./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_1270c.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 91052e8ecc9a867b12c5f0d5c9b1e4af952e3b52 .............................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_1270c.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 91052e8ecc9a867b12c5f0d5c9b1e4af952e3b52 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:54:18,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:54:18,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:54:18,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:54:18,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:54:18,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:54:18,859 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:54:18,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:54:18,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:54:18,869 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:54:18,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:54:18,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:54:18,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:54:18,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:54:18,874 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:54:18,876 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:54:18,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:54:18,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:54:18,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:54:18,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:54:18,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:54:18,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:54:18,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:54:18,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:54:18,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:54:18,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:54:18,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:54:18,889 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:54:18,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:54:18,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:54:18,891 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:54:18,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:54:18,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:54:18,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:54:18,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:54:18,893 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:54:18,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:54:18,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:54:18,894 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:54:18,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:54:18,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:54:18,896 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 01:54:18,911 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:54:18,911 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:54:18,912 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:54:18,912 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:54:18,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:54:18,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:54:18,913 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:54:18,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:54:18,914 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:54:18,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:54:18,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:54:18,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:54:18,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:54:18,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:54:18,915 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:54:18,915 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:54:18,915 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:54:18,915 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:54:18,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:54:18,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:54:18,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:54:18,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:54:18,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:18,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:54:18,917 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:54:18,917 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:54:18,917 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:54:18,917 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:54:18,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:54:18,918 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:54:18,918 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 -> 91052e8ecc9a867b12c5f0d5c9b1e4af952e3b52 [2021-08-26 01:54:19,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:54:19,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:54:19,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:54:19,163 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:54:19,163 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:54:19,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2021-08-26 01:54:19,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7833d911a/e5492950f11a49f2a6d10758790def2f/FLAG509445e3a [2021-08-26 01:54:19,546 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:54:19,547 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2021-08-26 01:54:19,553 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7833d911a/e5492950f11a49f2a6d10758790def2f/FLAG509445e3a [2021-08-26 01:54:19,561 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7833d911a/e5492950f11a49f2a6d10758790def2f [2021-08-26 01:54:19,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:54:19,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:54:19,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:19,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:54:19,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:54:19,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,568 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54048df6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19, skipping insertion in model container [2021-08-26 01:54:19,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:54:19,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:54:19,696 WARN L228 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_1270c.c[4703,4716] [2021-08-26 01:54:19,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:19,703 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:54:19,774 WARN L228 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_1270c.c[4703,4716] [2021-08-26 01:54:19,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:19,786 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:54:19,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19 WrapperNode [2021-08-26 01:54:19,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:19,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:19,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:54:19,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:54:19,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:19,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:54:19,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:54:19,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:54:19,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,885 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:54:19,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:54:19,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:54:19,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:54:19,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (1/1) ... [2021-08-26 01:54:19,900 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:19,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:54:19,922 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) [2021-08-26 01:54:19,939 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 [2021-08-26 01:54:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:54:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:54:19,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-08-26 01:54:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 01:54:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-08-26 01:54:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:54:19,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:54:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 01:54:19,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:54:20,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:54:20,546 INFO L299 CfgBuilder]: Removed 52 assume(true) statements. [2021-08-26 01:54:20,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:20 BoogieIcfgContainer [2021-08-26 01:54:20,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:54:20,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:54:20,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:54:20,551 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:54:20,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:54:19" (1/3) ... [2021-08-26 01:54:20,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bca7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:20, skipping insertion in model container [2021-08-26 01:54:20,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:19" (2/3) ... [2021-08-26 01:54:20,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bca7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:20, skipping insertion in model container [2021-08-26 01:54:20,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:20" (3/3) ... [2021-08-26 01:54:20,553 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c.c [2021-08-26 01:54:20,556 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:54:20,556 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:54:20,584 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:54:20,590 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-08-26 01:54:20,591 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:54:20,606 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 105 states have (on average 1.7142857142857142) internal successors, (180), 106 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:20,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 01:54:20,619 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:20,619 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:20,619 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:20,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:20,623 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2021-08-26 01:54:20,628 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:20,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929542891] [2021-08-26 01:54:20,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:20,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:20,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:54:20,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929542891] [2021-08-26 01:54:20,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929542891] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:20,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:20,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 01:54:20,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111265636] [2021-08-26 01:54:20,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:54:20,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:54:20,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:54:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:20,762 INFO L87 Difference]: Start difference. First operand has 107 states, 105 states have (on average 1.7142857142857142) internal successors, (180), 106 states have internal predecessors, (180), 0 states have call successors, (0), 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 8.0) internal successors, (16), 2 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) [2021-08-26 01:54:20,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:20,787 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2021-08-26 01:54:20,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:54:20,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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 [2021-08-26 01:54:20,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:20,795 INFO L225 Difference]: With dead ends: 212 [2021-08-26 01:54:20,795 INFO L226 Difference]: Without dead ends: 104 [2021-08-26 01:54:20,797 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-26 01:54:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-26 01:54:20,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2021-08-26 01:54:20,838 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2021-08-26 01:54:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:20,839 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-08-26 01:54:20,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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) [2021-08-26 01:54:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2021-08-26 01:54:20,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:20,841 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:20,842 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:20,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:54:20,842 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:20,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:20,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2021-08-26 01:54:20,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:54:20,847 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340621068] [2021-08-26 01:54:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:20,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:54:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:54:20,915 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:54:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:54:20,969 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:54:20,969 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:54:20,970 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:54:20,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 01:54:20,975 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:54:20,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:54:20 BoogieIcfgContainer [2021-08-26 01:54:20,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:54:20,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:54:20,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:54:20,995 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:54:20,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:20" (3/4) ... [2021-08-26 01:54:20,997 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:54:20,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:54:20,999 INFO L168 Benchmark]: Toolchain (without parser) took 1434.60 ms. Allocated memory was 56.6 MB in the beginning and 94.4 MB in the end (delta: 37.7 MB). Free memory was 35.3 MB in the beginning and 70.1 MB in the end (delta: -34.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:20,999 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 56.6 MB. Free memory was 37.7 MB in the beginning and 37.6 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:21,000 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.24 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 35.2 MB in the beginning and 54.3 MB in the end (delta: -19.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:21,000 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.39 ms. Allocated memory is still 73.4 MB. Free memory was 54.3 MB in the beginning and 51.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:21,001 INFO L168 Benchmark]: Boogie Preprocessor took 41.24 ms. Allocated memory is still 73.4 MB. Free memory was 51.5 MB in the beginning and 49.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:21,001 INFO L168 Benchmark]: RCFGBuilder took 653.10 ms. Allocated memory is still 73.4 MB. Free memory was 48.7 MB in the beginning and 40.9 MB in the end (delta: 7.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:21,002 INFO L168 Benchmark]: TraceAbstraction took 445.72 ms. Allocated memory was 73.4 MB in the beginning and 94.4 MB in the end (delta: 21.0 MB). Free memory was 40.6 MB in the beginning and 70.6 MB in the end (delta: -30.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:54:21,002 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 94.4 MB. Free memory was 70.6 MB in the beginning and 70.1 MB in the end (delta: 536.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:54:21,004 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 56.6 MB. Free memory was 37.7 MB in the beginning and 37.6 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 224.24 ms. Allocated memory was 56.6 MB in the beginning and 73.4 MB in the end (delta: 16.8 MB). Free memory was 35.2 MB in the beginning and 54.3 MB in the end (delta: -19.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 62.39 ms. Allocated memory is still 73.4 MB. Free memory was 54.3 MB in the beginning and 51.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.24 ms. Allocated memory is still 73.4 MB. Free memory was 51.5 MB in the beginning and 49.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 653.10 ms. Allocated memory is still 73.4 MB. Free memory was 48.7 MB in the beginning and 40.9 MB in the end (delta: 7.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 445.72 ms. Allocated memory was 73.4 MB in the beginning and 94.4 MB in the end (delta: 21.0 MB). Free memory was 40.6 MB in the beginning and 70.6 MB in the end (delta: -30.0 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. * Witness Printer took 2.88 ms. Allocated memory is still 94.4 MB. Free memory was 70.6 MB in the beginning and 70.1 MB in the end (delta: 536.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 237]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 120, overapproximation of bitwiseAnd at line 220. Possible FailurePath: [L14] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L231] float x = __VERIFIER_nondet_float(); [L232] float y = 1.0f / 0.0f; [L84] float a = x, b = y, t1, t2, y1, y2, w; [L85] __int32_t j, k, ha, hb; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L88] ieee_float_shape_type gf_u; [L89] gf_u.value = (x) [L90] EXPR gf_u.word [L90] (ha) = gf_u.word [L92] ha &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L94] ieee_float_shape_type gf_u; [L95] gf_u.value = (y) [L96] EXPR gf_u.word [L96] (hb) = gf_u.word [L98] hb &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L99] COND FALSE !(hb > ha) [L106] a = x [L107] b = y VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L110] ieee_float_shape_type sf_u; [L111] sf_u.word = (ha) [L112] EXPR sf_u.value [L112] (a) = sf_u.value [L115] ieee_float_shape_type sf_u; [L116] sf_u.word = (hb) [L117] EXPR sf_u.value [L117] (b) = sf_u.value [L119] COND TRUE (ha - hb) > 0xf000000L [L120] return a + b; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L234] float res = __ieee754_hypotf(x, y); [L214] __int32_t ix; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L216] ieee_float_shape_type gf_u; [L217] gf_u.value = (x) [L218] EXPR gf_u.word [L218] (ix) = gf_u.word [L220] ix &= 0x7fffffff [L221] return ((ix) == 0x7f800000L); VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L236] COND TRUE !isinf_float(res) [L237] reach_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 391.5ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 17.6ms, AutomataDifference: 46.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 139 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred 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.0ms DumpTime, AutomataMinimizationStatistics: 31.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 13.5ms SsaConstructionTime, 76.3ms SatisfiabilityAnalysisTime, 38.5ms InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 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 [2021-08-26 01:54:21,036 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:54:22,525 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:54:22,527 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:54:22,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:54:22,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:54:22,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:54:22,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:54:22,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:54:22,571 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:54:22,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:54:22,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:54:22,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:54:22,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:54:22,586 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:54:22,587 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:54:22,588 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:54:22,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:54:22,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:54:22,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:54:22,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:54:22,592 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:54:22,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:54:22,595 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:54:22,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:54:22,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:54:22,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:54:22,605 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:54:22,606 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:54:22,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:54:22,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:54:22,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:54:22,608 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:54:22,609 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:54:22,610 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:54:22,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:54:22,611 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:54:22,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:54:22,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:54:22,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:54:22,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:54:22,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:54:22,615 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 01:54:22,637 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:54:22,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:54:22,637 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:54:22,637 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:54:22,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:54:22,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:54:22,639 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:54:22,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:54:22,639 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:54:22,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:54:22,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:54:22,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:54:22,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:54:22,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:54:22,640 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:54:22,640 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:54:22,640 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:54:22,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:54:22,641 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:54:22,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:54:22,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:54:22,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:54:22,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:54:22,641 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:22,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:54:22,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:54:22,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:54:22,642 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:54:22,642 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:54:22,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:54:22,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:54:22,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:54:22,643 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 -> 91052e8ecc9a867b12c5f0d5c9b1e4af952e3b52 [2021-08-26 01:54:22,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:54:22,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:54:22,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:54:22,949 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:54:22,949 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:54:22,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2021-08-26 01:54:23,000 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5159cfaf/8d9c69e01b2c459fb31116859553c8fe/FLAG68e551a6e [2021-08-26 01:54:23,381 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:54:23,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1270c.c [2021-08-26 01:54:23,392 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5159cfaf/8d9c69e01b2c459fb31116859553c8fe/FLAG68e551a6e [2021-08-26 01:54:23,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5159cfaf/8d9c69e01b2c459fb31116859553c8fe [2021-08-26 01:54:23,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:54:23,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:54:23,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:23,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:54:23,417 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:54:23,418 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7b75bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23, skipping insertion in model container [2021-08-26 01:54:23,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:54:23,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:54:23,626 WARN L228 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_1270c.c[4703,4716] [2021-08-26 01:54:23,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:23,641 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:54:23,710 WARN L228 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_1270c.c[4703,4716] [2021-08-26 01:54:23,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:54:23,720 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:54:23,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23 WrapperNode [2021-08-26 01:54:23,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:54:23,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:23,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:54:23,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:54:23,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:54:23,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:54:23,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:54:23,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:54:23,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,807 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,810 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:54:23,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:54:23,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:54:23,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:54:23,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (1/1) ... [2021-08-26 01:54:23,828 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:54:23,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:54:23,846 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) [2021-08-26 01:54:23,876 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 [2021-08-26 01:54:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:54:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:54:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-08-26 01:54:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-26 01:54:23,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:54:23,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:54:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2021-08-26 01:54:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-08-26 01:54:23,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:54:29,555 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:54:29,555 INFO L299 CfgBuilder]: Removed 52 assume(true) statements. [2021-08-26 01:54:29,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:29 BoogieIcfgContainer [2021-08-26 01:54:29,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:54:29,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:54:29,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:54:29,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:54:29,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:54:23" (1/3) ... [2021-08-26 01:54:29,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17947abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:29, skipping insertion in model container [2021-08-26 01:54:29,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:54:23" (2/3) ... [2021-08-26 01:54:29,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17947abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:54:29, skipping insertion in model container [2021-08-26 01:54:29,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:54:29" (3/3) ... [2021-08-26 01:54:29,562 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270c.c [2021-08-26 01:54:29,565 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:54:29,565 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:54:29,592 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:54:29,596 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-08-26 01:54:29,596 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:54:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 105 states have (on average 1.7142857142857142) internal successors, (180), 106 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 01:54:29,612 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:29,613 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:29,614 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:29,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:29,617 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2021-08-26 01:54:29,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:29,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770714734] [2021-08-26 01:54:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:29,625 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:29,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:29,627 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) [2021-08-26 01:54:29,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 01:54:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:29,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-26 01:54:29,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:29,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:30,038 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:30,039 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770714734] [2021-08-26 01:54:30,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770714734] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:30,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:30,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-26 01:54:30,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263585727] [2021-08-26 01:54:30,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:54:30,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:54:30,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:30,054 INFO L87 Difference]: Start difference. First operand has 107 states, 105 states have (on average 1.7142857142857142) internal successors, (180), 106 states have internal predecessors, (180), 0 states have call successors, (0), 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 8.0) internal successors, (16), 2 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) [2021-08-26 01:54:30,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:30,070 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2021-08-26 01:54:30,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:54:30,071 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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 [2021-08-26 01:54:30,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:30,077 INFO L225 Difference]: With dead ends: 212 [2021-08-26 01:54:30,078 INFO L226 Difference]: Without dead ends: 104 [2021-08-26 01:54:30,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:54:30,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-26 01:54:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-08-26 01:54:30,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 103 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2021-08-26 01:54:30,104 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2021-08-26 01:54:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:30,104 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2021-08-26 01:54:30,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 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) [2021-08-26 01:54:30,105 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2021-08-26 01:54:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:30,106 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:30,106 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:30,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:30,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:30,316 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2021-08-26 01:54:30,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:30,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204458257] [2021-08-26 01:54:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:30,317 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:30,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:30,319 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) [2021-08-26 01:54:30,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 01:54:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:30,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 01:54:30,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:31,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:54:32,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:32,145 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:54:32,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204458257] [2021-08-26 01:54:32,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204458257] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:54:32,146 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:54:32,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 11 [2021-08-26 01:54:32,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275815269] [2021-08-26 01:54:32,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 01:54:32,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:54:32,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 01:54:32,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-26 01:54:32,148 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:34,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:54:34,536 INFO L93 Difference]: Finished difference Result 444 states and 576 transitions. [2021-08-26 01:54:34,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 01:54:34,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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 21 [2021-08-26 01:54:34,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:54:34,542 INFO L225 Difference]: With dead ends: 444 [2021-08-26 01:54:34,543 INFO L226 Difference]: Without dead ends: 358 [2021-08-26 01:54:34,545 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1355.9ms TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2021-08-26 01:54:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-08-26 01:54:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 113. [2021-08-26 01:54:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 112 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2021-08-26 01:54:34,572 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 21 [2021-08-26 01:54:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:54:34,573 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2021-08-26 01:54:34,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:54:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2021-08-26 01:54:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-26 01:54:34,574 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:54:34,574 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:54:34,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-26 01:54:34,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:54:34,782 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:54:34,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:54:34,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1653009985, now seen corresponding path program 1 times [2021-08-26 01:54:34,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:54:34,783 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511226436] [2021-08-26 01:54:34,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:54:34,784 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:54:34,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:54:34,784 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) [2021-08-26 01:54:34,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 01:54:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:54:34,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 28 conjunts are in the unsatisfiable core [2021-08-26 01:54:34,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:54:35,199 INFO L388 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 33 treesize of output 29 [2021-08-26 01:54:35,640 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-08-26 01:54:35,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2021-08-26 01:54:35,939 INFO L354 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2021-08-26 01:54:35,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 52 [2021-08-26 01:54:37,054 INFO L388 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 70 treesize of output 50 [2021-08-26 01:54:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:54:38,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:55:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:55:08,666 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:55:08,666 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511226436] [2021-08-26 01:55:08,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [511226436] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:55:08,666 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:55:08,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 14] imperfect sequences [] total 26 [2021-08-26 01:55:08,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751695717] [2021-08-26 01:55:08,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-08-26 01:55:08,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:55:08,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-08-26 01:55:08,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=562, Unknown=3, NotChecked=0, Total=650 [2021-08-26 01:55:08,668 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:55:41,429 WARN L207 SmtUtils]: Spent 27.84 s on a formula simplification that was a NOOP. DAG size: 82 [2021-08-26 01:55:58,422 WARN L207 SmtUtils]: Spent 5.86 s on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2021-08-26 01:56:06,808 WARN L207 SmtUtils]: Spent 6.01 s on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2021-08-26 01:56:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:56:14,904 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2021-08-26 01:56:14,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-26 01:56:14,910 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 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 21 [2021-08-26 01:56:14,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:56:14,910 INFO L225 Difference]: With dead ends: 135 [2021-08-26 01:56:14,911 INFO L226 Difference]: Without dead ends: 42 [2021-08-26 01:56:14,911 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 80060.1ms TimeCoverageRelationStatistics Valid=264, Invalid=993, Unknown=3, NotChecked=0, Total=1260 [2021-08-26 01:56:14,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-08-26 01:56:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-08-26 01:56:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:14,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2021-08-26 01:56:14,915 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2021-08-26 01:56:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:56:14,915 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-08-26 01:56:14,915 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:56:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2021-08-26 01:56:14,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:56:14,916 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:56:14,916 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:56:14,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-26 01:56:15,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:56:15,117 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:56:15,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:56:15,118 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2021-08-26 01:56:15,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:56:15,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715403586] [2021-08-26 01:56:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:56:15,118 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:56:15,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:56:15,119 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) [2021-08-26 01:56:15,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 01:56:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:56:15,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2021-08-26 01:56:15,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:56:15,577 INFO L388 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 47 treesize of output 43 [2021-08-26 01:56:16,190 INFO L388 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 54 treesize of output 30 [2021-08-26 01:56:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:56:16,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:56:20,494 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_isinf_float_~ix~1_17 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_ULTIMATE.start_isinf_float_~ix~1_17) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 30 23) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 22 0) v_ULTIMATE.start_isinf_float_~ix~1_17)) (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2021-08-26 01:56:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:56:57,009 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:56:57,010 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715403586] [2021-08-26 01:56:57,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715403586] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:56:57,010 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:56:57,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 12] imperfect sequences [] total 21 [2021-08-26 01:56:57,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947415989] [2021-08-26 01:56:57,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-26 01:56:57,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:56:57,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-26 01:56:57,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=318, Unknown=18, NotChecked=36, Total=420 [2021-08-26 01:56:57,011 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:19,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:57:19,900 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2021-08-26 01:57:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 01:57:19,901 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 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 26 [2021-08-26 01:57:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:57:19,901 INFO L225 Difference]: With dead ends: 54 [2021-08-26 01:57:19,901 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 01:57:19,902 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 62191.1ms TimeCoverageRelationStatistics Valid=208, Invalid=639, Unknown=27, NotChecked=56, Total=930 [2021-08-26 01:57:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 01:57:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2021-08-26 01:57:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2021-08-26 01:57:19,904 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2021-08-26 01:57:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:57:19,905 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2021-08-26 01:57:19,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.380952380952381) internal successors, (50), 21 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2021-08-26 01:57:19,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:57:19,905 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:57:19,905 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:57:19,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-26 01:57:20,109 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:57:20,109 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:57:20,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:57:20,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1435475906, now seen corresponding path program 1 times [2021-08-26 01:57:20,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:57:20,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994192146] [2021-08-26 01:57:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:57:20,110 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:57:20,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:57:20,111 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) [2021-08-26 01:57:20,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-26 01:57:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:57:20,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:57:20,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:57:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:57:21,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:57:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:57:22,493 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:57:22,493 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994192146] [2021-08-26 01:57:22,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994192146] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:57:22,494 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:57:22,494 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [] total 11 [2021-08-26 01:57:22,494 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250265006] [2021-08-26 01:57:22,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 01:57:22,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:57:22,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 01:57:22,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-08-26 01:57:22,495 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:57:23,033 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2021-08-26 01:57:23,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:57:23,034 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 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 26 [2021-08-26 01:57:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:57:23,034 INFO L225 Difference]: With dead ends: 36 [2021-08-26 01:57:23,036 INFO L226 Difference]: Without dead ends: 27 [2021-08-26 01:57:23,036 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 959.9ms TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2021-08-26 01:57:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-08-26 01:57:23,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-08-26 01:57:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0) internal successors, (26), 26 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2021-08-26 01:57:23,038 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2021-08-26 01:57:23,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:57:23,039 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2021-08-26 01:57:23,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:23,039 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2021-08-26 01:57:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-26 01:57:23,039 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:57:23,039 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:57:23,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-08-26 01:57:23,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:57:23,249 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:57:23,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:57:23,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2115534276, now seen corresponding path program 1 times [2021-08-26 01:57:23,250 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:57:23,250 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632046308] [2021-08-26 01:57:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:57:23,250 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:57:23,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:57:23,252 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) [2021-08-26 01:57:23,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-26 01:57:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:57:23,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-26 01:57:23,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:57:23,564 INFO L388 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 33 treesize of output 29 [2021-08-26 01:57:23,793 INFO L388 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 48 treesize of output 24 [2021-08-26 01:57:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:57:25,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:57:29,092 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_18|)) (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_18|) (_ bv2139095040 32)))) is different from false [2021-08-26 01:57:31,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_51 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_18| (_ BitVec 32))) (or (not (= c_ULTIMATE.start___ieee754_hypotf_~y (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_51) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_51) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_51)))) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_18|)) (let ((.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_51))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_18|) (_ bv2139095040 32)))) is different from false [2021-08-26 01:57:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:57:31,406 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:57:31,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632046308] [2021-08-26 01:57:31,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632046308] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:57:31,406 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:57:31,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 13] imperfect sequences [] total 23 [2021-08-26 01:57:31,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346825824] [2021-08-26 01:57:31,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-08-26 01:57:31,407 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:57:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-08-26 01:57:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=374, Unknown=2, NotChecked=78, Total=506 [2021-08-26 01:57:31,408 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:57:36,683 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2021-08-26 01:57:36,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-26 01:57:36,683 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 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 26 [2021-08-26 01:57:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:57:36,683 INFO L225 Difference]: With dead ends: 27 [2021-08-26 01:57:36,683 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:57:36,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 10656.4ms TimeCoverageRelationStatistics Valid=183, Invalid=753, Unknown=2, NotChecked=118, Total=1056 [2021-08-26 01:57:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:57:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:57:36,684 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) [2021-08-26 01:57:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:57:36,684 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-08-26 01:57:36,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:57:36,685 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:57:36,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:57:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:57:36,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:57:36,687 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:57:36,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-26 01:57:36,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:57:36,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:57:36,903 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:36,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:36,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:36,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,019 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,021 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,023 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,040 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,044 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,047 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:57:37,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:58:07,763 WARN L207 SmtUtils]: Spent 30.71 s on a formula simplification. DAG size of input: 225 DAG size of output: 182 [2021-08-26 01:59:59,156 WARN L207 SmtUtils]: Spent 1.86 m on a formula simplification. DAG size of input: 223 DAG size of output: 191 [2021-08-26 02:01:40,798 WARN L207 SmtUtils]: Spent 1.69 m on a formula simplification. DAG size of input: 213 DAG size of output: 181 [2021-08-26 02:01:41,007 INFO L857 garLoopResultBuilder]: For program point L168(lines 168 172) no Hoare annotation was computed. [2021-08-26 02:01:41,008 INFO L857 garLoopResultBuilder]: For program point L168-1(lines 159 173) no Hoare annotation was computed. [2021-08-26 02:01:41,008 INFO L857 garLoopResultBuilder]: For program point L202-1(lines 202 206) no Hoare annotation was computed. [2021-08-26 02:01:41,008 INFO L853 garLoopResultBuilder]: At program point L202-2(lines 202 206) the Hoare annotation is: false [2021-08-26 02:01:41,008 INFO L857 garLoopResultBuilder]: For program point L136-1(lines 136 140) no Hoare annotation was computed. [2021-08-26 02:01:41,008 INFO L857 garLoopResultBuilder]: For program point L202-3(lines 202 206) no Hoare annotation was computed. [2021-08-26 02:01:41,008 INFO L853 garLoopResultBuilder]: At program point L136-2(lines 136 140) the Hoare annotation is: false [2021-08-26 02:01:41,008 INFO L857 garLoopResultBuilder]: For program point L37(lines 37 41) no Hoare annotation was computed. [2021-08-26 02:01:41,008 INFO L857 garLoopResultBuilder]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2021-08-26 02:01:41,008 INFO L857 garLoopResultBuilder]: For program point L37-3(lines 37 41) no Hoare annotation was computed. [2021-08-26 02:01:41,008 INFO L857 garLoopResultBuilder]: For program point L37-5(lines 37 41) no Hoare annotation was computed. [2021-08-26 02:01:41,009 INFO L857 garLoopResultBuilder]: For program point L236(lines 236 239) no Hoare annotation was computed. [2021-08-26 02:01:41,009 INFO L857 garLoopResultBuilder]: For program point L38-2(lines 38 39) no Hoare annotation was computed. [2021-08-26 02:01:41,009 INFO L853 garLoopResultBuilder]: At program point L38-3(lines 38 39) the Hoare annotation is: false [2021-08-26 02:01:41,009 INFO L857 garLoopResultBuilder]: For program point L38-4(lines 38 39) no Hoare annotation was computed. [2021-08-26 02:01:41,009 INFO L857 garLoopResultBuilder]: For program point L38-7(lines 38 39) no Hoare annotation was computed. [2021-08-26 02:01:41,009 INFO L853 garLoopResultBuilder]: At program point L38-8(lines 38 39) the Hoare annotation is: false [2021-08-26 02:01:41,009 INFO L857 garLoopResultBuilder]: For program point L38-9(lines 38 39) no Hoare annotation was computed. [2021-08-26 02:01:41,009 INFO L857 garLoopResultBuilder]: For program point L237(line 237) no Hoare annotation was computed. [2021-08-26 02:01:41,009 INFO L860 garLoopResultBuilder]: At program point L240(lines 224 241) the Hoare annotation is: true [2021-08-26 02:01:41,009 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 145) no Hoare annotation was computed. [2021-08-26 02:01:41,010 INFO L857 garLoopResultBuilder]: For program point L141-1(lines 123 146) no Hoare annotation was computed. [2021-08-26 02:01:41,010 INFO L857 garLoopResultBuilder]: For program point L75-1(lines 75 79) no Hoare annotation was computed. [2021-08-26 02:01:41,010 INFO L853 garLoopResultBuilder]: At program point L75-2(lines 75 79) the Hoare annotation is: false [2021-08-26 02:01:41,010 INFO L857 garLoopResultBuilder]: For program point L75-3(lines 75 79) no Hoare annotation was computed. [2021-08-26 02:01:41,010 INFO L857 garLoopResultBuilder]: For program point L75-5(lines 75 79) no Hoare annotation was computed. [2021-08-26 02:01:41,010 INFO L853 garLoopResultBuilder]: At program point L75-6(lines 75 79) the Hoare annotation is: false [2021-08-26 02:01:41,010 INFO L857 garLoopResultBuilder]: For program point L75-7(lines 75 79) no Hoare annotation was computed. [2021-08-26 02:01:41,010 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2021-08-26 02:01:41,010 INFO L857 garLoopResultBuilder]: For program point L109-1(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:01:41,011 INFO L853 garLoopResultBuilder]: At program point L209(lines 83 210) the Hoare annotation is: (let ((.cse24 (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0)) (_ bv251658240 32)))) (.cse22 (bvneg ULTIMATE.start___ieee754_hypotf_~ha~0))) (let ((.cse8 (or (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0))))))) (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 .cse22) (_ bv251658240 32))))) (.cse9 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse10 (or .cse24 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse11 (or .cse24 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))))))) (.cse1 (let ((.cse25 (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (or (and .cse25 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)))) (and .cse24 .cse25)))) (.cse12 (or .cse24 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse3 (= currentRoundingMode roundNearestTiesToEven)) (.cse15 (or (not (bvsgt (bvadd (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_hypotf_~hb~0) .cse22) (_ bv251658240 32))) (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (let ((.cse23 (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse23) ((_ extract 30 23) .cse23) ((_ extract 22 0) .cse23))) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))))))))) (or (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (= ULTIMATE.start___ieee754_hypotf_~hb~0 .cse0) (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) .cse1 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0)) (= .cse2 ULTIMATE.start___ieee754_hypotf_~a~0) .cse3 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse5 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (= .cse4 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) .cse5) (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg .cse5)) (_ bv251658240 32)) (= |ULTIMATE.start___ieee754_hypotf_#res| (fp.add roundNearestTiesToEven .cse4 (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))))) (= .cse2 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse6 (let ((.cse7 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse6) (= |ULTIMATE.start___ieee754_hypotf_#res| .cse6)))) .cse8 .cse9 .cse10 .cse11 (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) .cse1 .cse12 (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse13 (let ((.cse14 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse13) (= ULTIMATE.start___ieee754_hypotf_~w~0 .cse13)))) .cse3 .cse15 (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse16 (let ((.cse17 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse16) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse16))))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_42 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_39 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse18 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_42) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_42) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_42)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse18 ULTIMATE.start___ieee754_hypotf_~hb~0) (bvsgt v_ULTIMATE.start___ieee754_hypotf_~hb~0_42 .cse18)))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse19 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse19 |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse19 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse20 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse20 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse20 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) .cse8 .cse9 (forall ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_18|)))) (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_18|) (_ bv2139095040 32)))) .cse10 .cse11 .cse1 (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse21 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse21 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse21 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) .cse12 .cse3 .cse15)))) [2021-08-26 02:01:41,011 INFO L857 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2021-08-26 02:01:41,011 INFO L857 garLoopResultBuilder]: For program point L44-2(lines 44 45) no Hoare annotation was computed. [2021-08-26 02:01:41,011 INFO L857 garLoopResultBuilder]: For program point L44-3(lines 44 45) no Hoare annotation was computed. [2021-08-26 02:01:41,011 INFO L857 garLoopResultBuilder]: For program point L44-5(lines 44 45) no Hoare annotation was computed. [2021-08-26 02:01:41,011 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 200) no Hoare annotation was computed. [2021-08-26 02:01:41,012 INFO L857 garLoopResultBuilder]: For program point L177-2(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:01:41,012 INFO L857 garLoopResultBuilder]: For program point L178-1(lines 178 182) no Hoare annotation was computed. [2021-08-26 02:01:41,012 INFO L853 garLoopResultBuilder]: At program point L178-2(lines 178 182) the Hoare annotation is: false [2021-08-26 02:01:41,012 INFO L857 garLoopResultBuilder]: For program point L178-3(lines 178 182) no Hoare annotation was computed. [2021-08-26 02:01:41,012 INFO L853 garLoopResultBuilder]: At program point L80(lines 16 81) the Hoare annotation is: false [2021-08-26 02:01:41,012 INFO L853 garLoopResultBuilder]: At program point L80-1(lines 16 81) the Hoare annotation is: false [2021-08-26 02:01:41,012 INFO L857 garLoopResultBuilder]: For program point L147(lines 147 174) no Hoare annotation was computed. [2021-08-26 02:01:41,012 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 118) no Hoare annotation was computed. [2021-08-26 02:01:41,012 INFO L857 garLoopResultBuilder]: For program point L114-1(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:01:41,013 INFO L857 garLoopResultBuilder]: For program point L114-2(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:01:41,013 INFO L857 garLoopResultBuilder]: For program point L148(lines 148 173) no Hoare annotation was computed. [2021-08-26 02:01:41,013 INFO L857 garLoopResultBuilder]: For program point L215-1(lines 215 219) no Hoare annotation was computed. [2021-08-26 02:01:41,013 INFO L853 garLoopResultBuilder]: At program point L215-2(lines 215 219) the Hoare annotation is: (let ((.cse29 (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0)) (_ bv251658240 32)))) (.cse27 (bvneg ULTIMATE.start___ieee754_hypotf_~ha~0))) (let ((.cse10 (or (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0))))))) (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~hb~0 .cse27) (_ bv251658240 32))))) (.cse11 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse12 (or .cse29 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse13 (or .cse29 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))))))))) (.cse1 (let ((.cse30 (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (or (and .cse30 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)))) (and .cse29 .cse30)))) (.cse16 (or .cse29 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse5 (= currentRoundingMode roundNearestTiesToEven)) (.cse19 (or (not (bvsgt (bvadd (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_hypotf_~hb~0) .cse27) (_ bv251658240 32))) (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) (fp.add currentRoundingMode (let ((.cse28 (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse28) ((_ extract 30 23) .cse28) ((_ extract 22 0) .cse28))) (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))))))))) (or (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)))) (and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (= ULTIMATE.start___ieee754_hypotf_~hb~0 .cse0) (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) .cse1 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0)) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse3 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (= (fp.add roundNearestTiesToEven .cse2 (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ULTIMATE.start_isinf_float_~x) (= .cse2 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) .cse3) (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg .cse3)) (_ bv251658240 32))))) (= .cse4 ULTIMATE.start___ieee754_hypotf_~a~0) .cse5 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32)) (|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7| (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse7 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_7|) (_ bv0 32)))) (and (= .cse6 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) .cse7) (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg .cse7)) (_ bv251658240 32)) (= |ULTIMATE.start___ieee754_hypotf_#res| (fp.add roundNearestTiesToEven .cse6 (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))))) (= .cse4 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))))) (and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse8 (let ((.cse9 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse8) (= |ULTIMATE.start___ieee754_hypotf_#res| .cse8)))) .cse10 .cse11 .cse12 .cse13 (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse14 (let ((.cse15 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse14) (= .cse14 ULTIMATE.start_isinf_float_~x)))) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) .cse1 .cse16 (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse17 (let ((.cse18 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse17) (= ULTIMATE.start___ieee754_hypotf_~w~0 .cse17)))) .cse5 .cse19 (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse20 (let ((.cse21 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse21) ((_ extract 30 23) .cse21) ((_ extract 22 0) .cse21))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse20) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse20))))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_42 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_39 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse22 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_42) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_42) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_42)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse22 ULTIMATE.start___ieee754_hypotf_~hb~0) (bvsgt v_ULTIMATE.start___ieee754_hypotf_~hb~0_42 .cse22)))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse23 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse23 |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse23 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse24 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse24 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse24 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) .cse10 .cse11 (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse25 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse25 ULTIMATE.start_isinf_float_~x) (= .cse25 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (forall ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_18|)))) (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_18|) (_ bv2139095040 32)))) .cse12 .cse13 .cse1 (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse26 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse26 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse26 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) .cse16 .cse5 .cse19)))) [2021-08-26 02:01:41,013 INFO L857 garLoopResultBuilder]: For program point L215-3(lines 215 219) no Hoare annotation was computed. [2021-08-26 02:01:41,013 INFO L857 garLoopResultBuilder]: For program point L150(lines 150 173) no Hoare annotation was computed. [2021-08-26 02:01:41,013 INFO L857 garLoopResultBuilder]: For program point L151-1(lines 151 155) no Hoare annotation was computed. [2021-08-26 02:01:41,013 INFO L853 garLoopResultBuilder]: At program point L151-2(lines 151 155) the Hoare annotation is: false [2021-08-26 02:01:41,013 INFO L857 garLoopResultBuilder]: For program point L151-3(lines 151 155) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L853 garLoopResultBuilder]: At program point L52-2(lines 52 61) the Hoare annotation is: false [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L52-3(lines 16 81) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L853 garLoopResultBuilder]: At program point L52-6(lines 52 61) the Hoare annotation is: false [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L52-7(lines 16 81) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L87-1(lines 87 91) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 58) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L853 garLoopResultBuilder]: At program point L87-2(lines 87 91) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (forall ((v_ULTIMATE.start_isinf_float_~ix~1_17 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_ULTIMATE.start_isinf_float_~ix~1_17) (_ bv2139095040 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 30 23) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 22 0) v_ULTIMATE.start_isinf_float_~ix~1_17)))))) (= currentRoundingMode roundNearestTiesToEven)) [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L87-3(lines 87 91) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L54-2(lines 54 58) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L853 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: false [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L54-3(lines 54 58) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L21-3(lines 21 25) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L54-5(lines 54 58) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L21-5(lines 21 25) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L853 garLoopResultBuilder]: At program point L21-6(lines 21 25) the Hoare annotation is: false [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L21-7(lines 21 25) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L187-1(lines 187 191) no Hoare annotation was computed. [2021-08-26 02:01:41,014 INFO L853 garLoopResultBuilder]: At program point L187-2(lines 187 191) the Hoare annotation is: false [2021-08-26 02:01:41,014 INFO L857 garLoopResultBuilder]: For program point L187-3(lines 187 191) no Hoare annotation was computed. [2021-08-26 02:01:41,015 INFO L853 garLoopResultBuilder]: At program point L221(lines 213 222) the Hoare annotation is: (let ((.cse24 (not (bvsgt (bvadd ULTIMATE.start___ieee754_hypotf_~ha~0 (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0)) (_ bv251658240 32))))) (let ((.cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse18 (or .cse24 (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp.add currentRoundingMode ULTIMATE.start___ieee754_hypotf_~a~0 ULTIMATE.start___ieee754_hypotf_~b~0) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)))))))) (.cse5 (let ((.cse23 (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (or (and .cse23 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26)))) (and .cse24 .cse23)))) (.cse9 (= currentRoundingMode roundNearestTiesToEven)) (.cse10 (= |ULTIMATE.start_isinf_float_#res| (_ bv1 32)))) (or (and (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse0 (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse0) (= |ULTIMATE.start___ieee754_hypotf_#res| .cse0)))) .cse2 (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse3 (let ((.cse4 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse3) (= .cse3 ULTIMATE.start_isinf_float_~x)))) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))) .cse5 (exists ((v_arrayElimCell_4 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse6 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) .cse6) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse6)))) (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse7 (let ((.cse8 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse7) (= ULTIMATE.start___ieee754_hypotf_~w~0 .cse7)))) .cse9 .cse10 (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse11 (let ((.cse12 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~2.base_10|) (_ bv0 32)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (and (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) .cse11) (= ULTIMATE.start___ieee754_hypotf_~b~0 .cse11))))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_42 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_39 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse13 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_39))) (and (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_42) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_42) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_42)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse13 ULTIMATE.start___ieee754_hypotf_~hb~0) (bvsgt v_ULTIMATE.start___ieee754_hypotf_~hb~0_42 .cse13)))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse14 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse14 |ULTIMATE.start___ieee754_hypotf_#res|) (= .cse14 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse15 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse15 ULTIMATE.start___ieee754_hypotf_~a~0) (= .cse15 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) .cse2 (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse16 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse16 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (= .cse16 (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)))))) (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse17 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse17 ULTIMATE.start_isinf_float_~x) (= .cse17 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) (forall ((|v_skolemized_q#valueAsBitvector_18| (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_18|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_18|)))) (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_18|) (_ bv2139095040 32)))) .cse18 .cse5 (exists ((v_arrayElimCell_5 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse19 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)))) (and (= .cse19 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse19 (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)))))) .cse9 .cse10) (and (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) ULTIMATE.start_isinf_float_~x)))) (forall ((|v_skolemized_q#valueAsBitvector_13| (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) |v_skolemized_q#valueAsBitvector_13|) (_ bv2139095040 32)) (not (= (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_13|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_13|)) |ULTIMATE.start___ieee754_hypotf_#res|)))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32)) (ULTIMATE.start___ieee754_hypotf_~ha~0 (_ BitVec 32))) (let ((.cse20 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0))) (.cse21 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30))) (and (= .cse20 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 1.0) (_ +zero 8 24))) (bvsgt (bvadd (bvneg .cse21) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)) (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (fp.add roundNearestTiesToEven .cse20 (fp ((_ extract 31 31) .cse21) ((_ extract 30 23) .cse21) ((_ extract 22 0) .cse21))))))) .cse18 .cse5 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0)) .cse9 (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) .cse10 (exists ((|v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1.base_7| (_ BitVec 32))) (let ((.cse22 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_hypotf_~#sf_u~1.base_7|) (_ bv0 32)))) (and (= ULTIMATE.start___ieee754_hypotf_~a~0 (fp ((_ extract 31 31) .cse22) ((_ extract 30 23) .cse22) ((_ extract 22 0) .cse22))) (= .cse22 ULTIMATE.start___ieee754_hypotf_~ha~0)))))))) [2021-08-26 02:01:41,015 INFO L857 garLoopResultBuilder]: For program point L123(lines 123 146) no Hoare annotation was computed. [2021-08-26 02:01:41,015 INFO L857 garLoopResultBuilder]: For program point L123-1(lines 83 210) no Hoare annotation was computed. [2021-08-26 02:01:41,015 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 02:01:41,015 INFO L857 garLoopResultBuilder]: For program point L124(lines 124 131) no Hoare annotation was computed. [2021-08-26 02:01:41,015 INFO L857 garLoopResultBuilder]: For program point L126(lines 126 127) no Hoare annotation was computed. [2021-08-26 02:01:41,015 INFO L857 garLoopResultBuilder]: For program point L93-1(lines 93 97) no Hoare annotation was computed. [2021-08-26 02:01:41,015 INFO L857 garLoopResultBuilder]: For program point L126-2(lines 124 131) no Hoare annotation was computed. [2021-08-26 02:01:41,015 INFO L853 garLoopResultBuilder]: At program point L93-2(lines 93 97) the Hoare annotation is: (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_39 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_39) ULTIMATE.start___ieee754_hypotf_~ha~0)) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24))) (forall ((v_ULTIMATE.start_isinf_float_~ix~1_17 (_ BitVec 32))) (or (= (bvand (_ bv2147483647 32) v_ULTIMATE.start_isinf_float_~ix~1_17) (_ bv2139095040 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 30 23) v_ULTIMATE.start_isinf_float_~ix~1_17) ((_ extract 22 0) v_ULTIMATE.start_isinf_float_~ix~1_17)))))) (= currentRoundingMode roundNearestTiesToEven)) [2021-08-26 02:01:41,015 INFO L857 garLoopResultBuilder]: For program point L93-3(lines 93 97) no Hoare annotation was computed. [2021-08-26 02:01:41,016 INFO L857 garLoopResultBuilder]: For program point L193-1(lines 193 197) no Hoare annotation was computed. [2021-08-26 02:01:41,016 INFO L853 garLoopResultBuilder]: At program point L193-2(lines 193 197) the Hoare annotation is: false [2021-08-26 02:01:41,016 INFO L857 garLoopResultBuilder]: For program point L193-3(lines 193 197) no Hoare annotation was computed. [2021-08-26 02:01:41,016 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 02:01:41,016 INFO L857 garLoopResultBuilder]: For program point L28(lines 28 29) no Hoare annotation was computed. [2021-08-26 02:01:41,016 INFO L857 garLoopResultBuilder]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2021-08-26 02:01:41,016 INFO L857 garLoopResultBuilder]: For program point L128-1(lines 128 129) no Hoare annotation was computed. [2021-08-26 02:01:41,016 INFO L857 garLoopResultBuilder]: For program point L63(lines 63 72) no Hoare annotation was computed. [2021-08-26 02:01:41,016 INFO L857 garLoopResultBuilder]: For program point L63-1(lines 63 72) no Hoare annotation was computed. [2021-08-26 02:01:41,016 INFO L857 garLoopResultBuilder]: For program point L163-1(lines 163 167) no Hoare annotation was computed. [2021-08-26 02:01:41,017 INFO L853 garLoopResultBuilder]: At program point L163-2(lines 163 167) the Hoare annotation is: false [2021-08-26 02:01:41,017 INFO L857 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2021-08-26 02:01:41,017 INFO L857 garLoopResultBuilder]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2021-08-26 02:01:41,017 INFO L857 garLoopResultBuilder]: For program point L65(lines 65 71) no Hoare annotation was computed. [2021-08-26 02:01:41,017 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 02:01:41,017 INFO L857 garLoopResultBuilder]: For program point L65-2(lines 65 71) no Hoare annotation was computed. [2021-08-26 02:01:41,017 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 237) no Hoare annotation was computed. [2021-08-26 02:01:41,017 INFO L857 garLoopResultBuilder]: For program point L99(lines 99 108) no Hoare annotation was computed. [2021-08-26 02:01:41,017 INFO L857 garLoopResultBuilder]: For program point L33(lines 33 34) no Hoare annotation was computed. [2021-08-26 02:01:41,018 INFO L857 garLoopResultBuilder]: For program point L33-1(lines 33 34) no Hoare annotation was computed. [2021-08-26 02:01:41,018 INFO L857 garLoopResultBuilder]: For program point L67(lines 67 70) no Hoare annotation was computed. [2021-08-26 02:01:41,018 INFO L857 garLoopResultBuilder]: For program point L67-3(lines 67 70) no Hoare annotation was computed. [2021-08-26 02:01:41,021 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 02:01:41,025 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:452) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-08-26 02:01:41,030 INFO L168 Benchmark]: Toolchain (without parser) took 437617.05 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 43.1 MB in the beginning and 44.0 MB in the end (delta: -869.1 kB). Peak memory consumption was 40.4 MB. Max. memory is 16.1 GB. [2021-08-26 02:01:41,030 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 62.9 MB. Free memory is still 43.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 02:01:41,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.97 ms. Allocated memory is still 62.9 MB. Free memory was 43.0 MB in the beginning and 41.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 02:01:41,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.23 ms. Allocated memory is still 62.9 MB. Free memory was 41.2 MB in the beginning and 38.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 02:01:41,030 INFO L168 Benchmark]: Boogie Preprocessor took 66.40 ms. Allocated memory is still 62.9 MB. Free memory was 38.3 MB in the beginning and 35.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 02:01:41,030 INFO L168 Benchmark]: RCFGBuilder took 5734.23 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 35.6 MB in the beginning and 41.9 MB in the end (delta: -6.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 16.1 GB. [2021-08-26 02:01:41,031 INFO L168 Benchmark]: TraceAbstraction took 431471.05 ms. Allocated memory is still 77.6 MB. Free memory was 41.5 MB in the beginning and 44.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 16.1 GB. [2021-08-26 02:01:41,032 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 62.9 MB. Free memory is still 43.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 306.97 ms. Allocated memory is still 62.9 MB. Free memory was 43.0 MB in the beginning and 41.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 33.23 ms. Allocated memory is still 62.9 MB. Free memory was 41.2 MB in the beginning and 38.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.40 ms. Allocated memory is still 62.9 MB. Free memory was 38.3 MB in the beginning and 35.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 5734.23 ms. Allocated memory was 62.9 MB in the beginning and 77.6 MB in the end (delta: 14.7 MB). Free memory was 35.6 MB in the beginning and 41.9 MB in the end (delta: -6.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 431471.05 ms. Allocated memory is still 77.6 MB. Free memory was 41.5 MB in the beginning and 44.0 MB in the end (delta: -2.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 237]: 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, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 431430.2ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 12.7ms, AutomataDifference: 97384.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 244107.6ms, InitialAbstractionConstructionTime: 6.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 317 SDtfs, 2390 SDslu, 766 SDs, 0 SdLazy, 699 SolverSat, 161 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12990.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 175 SyntacticMatches, 5 SemanticMatches, 120 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 155223.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=2, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 51.1ms AutomataMinimizationTime, 6 MinimizatonAttempts, 260 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 23 LocationsWithAnnotation, 23 PreInvPairs, 35 NumberOfFragments, 2807 HoareAnnotationTreeSize, 23 FomulaSimplifications, 2944 FormulaSimplificationTreeSizeReduction, 145.7ms HoareSimplificationTime, 23 FomulaSimplificationsInter, 3513 FormulaSimplificationTreeSizeReductionInter, 243952.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 94.4ms SsaConstructionTime, 461.9ms SatisfiabilityAnalysisTime, 87457.3ms InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 260 ConstructedInterpolants, 143 QuantifiedInterpolants, 4387 SizeOfPredicates, 67 NumberOfNonLiveVariables, 534 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-08-26 02:01:41,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...