./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float6.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float6.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 fd27604fe9b1767824ea9ccd6f7ecdb4d002f9be3c28c3385ab6133c7bd8f97d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:20:31,846 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:20:31,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:20:31,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:20:31,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:20:31,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:20:31,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:20:31,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:20:31,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:20:31,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:20:31,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:20:31,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:20:31,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:20:31,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:20:31,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:20:31,926 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:20:31,927 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:20:31,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:20:31,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:20:31,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:20:31,936 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:20:31,937 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:20:31,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:20:31,940 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:20:31,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:20:31,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:20:31,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:20:31,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:20:31,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:20:31,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:20:31,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:20:31,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:20:31,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:20:31,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:20:31,950 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:20:31,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:20:31,951 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:20:31,951 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:20:31,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:20:31,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:20:31,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:20:31,954 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:20:31,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:20:31,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:20:31,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:20:31,993 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:20:31,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:20:31,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:20:31,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:20:31,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:20:31,995 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:20:31,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:20:31,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:20:31,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:20:31,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:20:31,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:20:31,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:20:31,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:20:31,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:20:31,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:20:31,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:20:31,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:20:31,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:20:31,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:20:31,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:20:31,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:20:31,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:20:31,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:20:31,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:20:31,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:20:31,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:20:31,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:20:32,000 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:20:32,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:20:32,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:20:32,000 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 -> fd27604fe9b1767824ea9ccd6f7ecdb4d002f9be3c28c3385ab6133c7bd8f97d [2022-02-20 16:20:32,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:20:32,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:20:32,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:20:32,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:20:32,267 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:20:32,268 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float6.c [2022-02-20 16:20:32,326 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab7e070b/3adeead5a6084b4690cb41f24a9c3294/FLAGb9da8dc2d [2022-02-20 16:20:32,735 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:20:32,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c [2022-02-20 16:20:32,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab7e070b/3adeead5a6084b4690cb41f24a9c3294/FLAGb9da8dc2d [2022-02-20 16:20:32,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aab7e070b/3adeead5a6084b4690cb41f24a9c3294 [2022-02-20 16:20:32,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:20:32,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:20:32,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:20:32,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:20:32,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:20:32,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:20:32" (1/1) ... [2022-02-20 16:20:32,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d712e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:32, skipping insertion in model container [2022-02-20 16:20:32,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:20:32" (1/1) ... [2022-02-20 16:20:32,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:20:32,790 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:20:32,941 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[369,382] [2022-02-20 16:20:32,945 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[412,425] [2022-02-20 16:20:32,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[454,467] [2022-02-20 16:20:32,947 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[501,514] [2022-02-20 16:20:32,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[543,556] [2022-02-20 16:20:32,949 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[590,603] [2022-02-20 16:20:32,950 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[635,648] [2022-02-20 16:20:32,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[682,695] [2022-02-20 16:20:32,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[727,740] [2022-02-20 16:20:32,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[774,787] [2022-02-20 16:20:32,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[817,830] [2022-02-20 16:20:32,955 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[862,875] [2022-02-20 16:20:32,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[905,918] [2022-02-20 16:20:32,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[950,963] [2022-02-20 16:20:32,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[993,1006] [2022-02-20 16:20:32,957 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1041,1054] [2022-02-20 16:20:32,964 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1084,1097] [2022-02-20 16:20:32,965 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1132,1145] [2022-02-20 16:20:32,971 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1291,1304] [2022-02-20 16:20:32,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1330,1343] [2022-02-20 16:20:32,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1368,1381] [2022-02-20 16:20:32,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1411,1424] [2022-02-20 16:20:32,984 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1449,1462] [2022-02-20 16:20:32,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1492,1505] [2022-02-20 16:20:32,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1533,1546] [2022-02-20 16:20:32,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1576,1589] [2022-02-20 16:20:32,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1617,1630] [2022-02-20 16:20:32,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1660,1673] [2022-02-20 16:20:32,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1699,1712] [2022-02-20 16:20:32,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1740,1753] [2022-02-20 16:20:32,992 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1779,1792] [2022-02-20 16:20:32,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1820,1833] [2022-02-20 16:20:32,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1859,1872] [2022-02-20 16:20:32,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1903,1916] [2022-02-20 16:20:32,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1942,1955] [2022-02-20 16:20:32,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1986,1999] [2022-02-20 16:20:33,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:20:33,010 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:20:33,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[369,382] [2022-02-20 16:20:33,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[412,425] [2022-02-20 16:20:33,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[454,467] [2022-02-20 16:20:33,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[501,514] [2022-02-20 16:20:33,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[543,556] [2022-02-20 16:20:33,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[590,603] [2022-02-20 16:20:33,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[635,648] [2022-02-20 16:20:33,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[682,695] [2022-02-20 16:20:33,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[727,740] [2022-02-20 16:20:33,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[774,787] [2022-02-20 16:20:33,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[817,830] [2022-02-20 16:20:33,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[862,875] [2022-02-20 16:20:33,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[905,918] [2022-02-20 16:20:33,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[950,963] [2022-02-20 16:20:33,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[993,1006] [2022-02-20 16:20:33,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1041,1054] [2022-02-20 16:20:33,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1084,1097] [2022-02-20 16:20:33,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1132,1145] [2022-02-20 16:20:33,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1291,1304] [2022-02-20 16:20:33,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1330,1343] [2022-02-20 16:20:33,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1368,1381] [2022-02-20 16:20:33,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1411,1424] [2022-02-20 16:20:33,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1449,1462] [2022-02-20 16:20:33,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1492,1505] [2022-02-20 16:20:33,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1533,1546] [2022-02-20 16:20:33,060 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1576,1589] [2022-02-20 16:20:33,061 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1617,1630] [2022-02-20 16:20:33,062 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1660,1673] [2022-02-20 16:20:33,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1699,1712] [2022-02-20 16:20:33,063 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1740,1753] [2022-02-20 16:20:33,064 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1779,1792] [2022-02-20 16:20:33,065 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1820,1833] [2022-02-20 16:20:33,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1859,1872] [2022-02-20 16:20:33,066 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1903,1916] [2022-02-20 16:20:33,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1942,1955] [2022-02-20 16:20:33,068 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1986,1999] [2022-02-20 16:20:33,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:20:33,079 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:20:33,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33 WrapperNode [2022-02-20 16:20:33,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:20:33,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:20:33,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:20:33,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:20:33,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,128 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2022-02-20 16:20:33,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:20:33,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:20:33,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:20:33,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:20:33,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,138 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:20:33,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:20:33,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:20:33,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:20:33,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (1/1) ... [2022-02-20 16:20:33,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:20:33,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:20:33,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:20:33,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:20:33,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:20:33,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:20:33,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:20:33,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:20:33,279 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:20:33,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:20:33,494 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:20:33,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:20:33,500 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:20:33,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:20:33 BoogieIcfgContainer [2022-02-20 16:20:33,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:20:33,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:20:33,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:20:33,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:20:33,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:20:32" (1/3) ... [2022-02-20 16:20:33,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39be2bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:20:33, skipping insertion in model container [2022-02-20 16:20:33,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:33" (2/3) ... [2022-02-20 16:20:33,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39be2bf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:20:33, skipping insertion in model container [2022-02-20 16:20:33,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:20:33" (3/3) ... [2022-02-20 16:20:33,508 INFO L111 eAbstractionObserver]: Analyzing ICFG float6.c [2022-02-20 16:20:33,512 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:20:33,513 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-02-20 16:20:33,568 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:20:33,579 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:20:33,580 INFO L340 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-02-20 16:20:33,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 78 states have (on average 1.935897435897436) internal successors, (151), 114 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 16:20:33,613 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:33,614 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 16:20:33,615 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:33,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:33,622 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-02-20 16:20:33,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:20:33,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217512637] [2022-02-20 16:20:33,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:33,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:20:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:20:33,713 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:20:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:20:33,745 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:20:33,748 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:20:33,749 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (35 of 36 remaining) [2022-02-20 16:20:33,750 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (34 of 36 remaining) [2022-02-20 16:20:33,751 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (33 of 36 remaining) [2022-02-20 16:20:33,754 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (32 of 36 remaining) [2022-02-20 16:20:33,755 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (31 of 36 remaining) [2022-02-20 16:20:33,756 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (30 of 36 remaining) [2022-02-20 16:20:33,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (29 of 36 remaining) [2022-02-20 16:20:33,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (28 of 36 remaining) [2022-02-20 16:20:33,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (27 of 36 remaining) [2022-02-20 16:20:33,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (26 of 36 remaining) [2022-02-20 16:20:33,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (25 of 36 remaining) [2022-02-20 16:20:33,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (24 of 36 remaining) [2022-02-20 16:20:33,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (23 of 36 remaining) [2022-02-20 16:20:33,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (22 of 36 remaining) [2022-02-20 16:20:33,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (21 of 36 remaining) [2022-02-20 16:20:33,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (20 of 36 remaining) [2022-02-20 16:20:33,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (19 of 36 remaining) [2022-02-20 16:20:33,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (18 of 36 remaining) [2022-02-20 16:20:33,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (17 of 36 remaining) [2022-02-20 16:20:33,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (16 of 36 remaining) [2022-02-20 16:20:33,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (15 of 36 remaining) [2022-02-20 16:20:33,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (14 of 36 remaining) [2022-02-20 16:20:33,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (13 of 36 remaining) [2022-02-20 16:20:33,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (12 of 36 remaining) [2022-02-20 16:20:33,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (11 of 36 remaining) [2022-02-20 16:20:33,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (10 of 36 remaining) [2022-02-20 16:20:33,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (9 of 36 remaining) [2022-02-20 16:20:33,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (8 of 36 remaining) [2022-02-20 16:20:33,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (7 of 36 remaining) [2022-02-20 16:20:33,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (6 of 36 remaining) [2022-02-20 16:20:33,771 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (5 of 36 remaining) [2022-02-20 16:20:33,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (4 of 36 remaining) [2022-02-20 16:20:33,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (3 of 36 remaining) [2022-02-20 16:20:33,772 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (2 of 36 remaining) [2022-02-20 16:20:33,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (1 of 36 remaining) [2022-02-20 16:20:33,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (0 of 36 remaining) [2022-02-20 16:20:33,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:20:33,780 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-02-20 16:20:33,784 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:20:33,805 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:20:33,806 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:20:33,806 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 16:20:33,806 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 16:20:33,806 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2022-02-20 16:20:33,806 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2022-02-20 16:20:33,807 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2022-02-20 16:20:33,807 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2022-02-20 16:20:33,807 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 16:20:33,807 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 16:20:33,807 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 16:20:33,807 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 16:20:33,807 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:20:33,808 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:20:33,808 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-02-20 16:20:33,808 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-02-20 16:20:33,808 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 16:20:33,808 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 16:20:33,808 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 16:20:33,809 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 16:20:33,809 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 16:20:33,809 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 16:20:33,809 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-02-20 16:20:33,809 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-02-20 16:20:33,810 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 16:20:33,810 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 16:20:33,810 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-20 16:20:33,810 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-20 16:20:33,810 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:20:33,810 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:20:33,811 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 16:20:33,811 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 16:20:33,811 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 16:20:33,811 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 16:20:33,811 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:20:33,812 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:20:33,812 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 16:20:33,812 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 16:20:33,812 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-20 16:20:33,812 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-20 16:20:33,813 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:20:33,813 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:20:33,813 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:20:33,813 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:20:33,813 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 16:20:33,813 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 16:20:33,813 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:20:33,814 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:20:33,814 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:20:33,814 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:20:33,814 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-20 16:20:33,814 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-20 16:20:33,814 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:20:33,815 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:20:33,815 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:20:33,815 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:20:33,815 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 16:20:33,815 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 16:20:33,815 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:20:33,815 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:20:33,816 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:20:33,816 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:20:33,816 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-02-20 16:20:33,816 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-02-20 16:20:33,816 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:20:33,816 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:20:33,817 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:20:33,817 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:20:33,817 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:20:33,817 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:20:33,817 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-02-20 16:20:33,817 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-02-20 16:20:33,818 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:20:33,818 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:20:33,818 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:20:33,818 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:20:33,818 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:20:33,818 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-02-20 16:20:33,819 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-02-20 16:20:33,819 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:20:33,819 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:20:33,819 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:20:33,820 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:20:33,820 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:20:33,820 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:20:33,820 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 16:20:33,820 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 16:20:33,821 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:20:33,821 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:20:33,821 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-02-20 16:20:33,821 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-02-20 16:20:33,821 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:20:33,821 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:20:33,822 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:20:33,825 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:20:33,825 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:20:33,825 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:20:33,825 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2022-02-20 16:20:33,825 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2022-02-20 16:20:33,826 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:20:33,826 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:20:33,826 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:20:33,826 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:20:33,828 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:20:33,828 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:20:33,828 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:20:33,829 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:20:33,829 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:20:33,829 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:20:33,829 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:20:33,829 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:20:33,829 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:20:33,829 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:20:33,830 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:20:33,830 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:20:33,830 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:20:33,830 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:20:33,830 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:20:33,830 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:20:33,830 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:20:33,831 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:20:33,831 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 16:20:33,831 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 16:20:33,831 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:20:33,831 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:20:33,831 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:20:33,831 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:20:33,832 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:20:33,832 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:20:33,832 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-02-20 16:20:33,832 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-02-20 16:20:33,832 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:20:33,832 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:20:33,832 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-02-20 16:20:33,833 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-02-20 16:20:33,833 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:20:33,833 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:20:33,833 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:20:33,833 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:20:33,834 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:20:33,834 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:20:33,834 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 16:20:33,834 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 16:20:33,834 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:20:33,834 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:20:33,835 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:20:33,835 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:20:33,835 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:20:33,835 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:20:33,835 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 16:20:33,835 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:20:33,836 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:20:33,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:20:33 BoogieIcfgContainer [2022-02-20 16:20:33,841 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:20:33,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:20:33,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:20:33,844 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:20:33,845 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:20:33" (3/4) ... [2022-02-20 16:20:33,849 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:20:33,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:20:33,850 INFO L158 Benchmark]: Toolchain (without parser) took 1090.35ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 72.8MB in the beginning and 84.2MB in the end (delta: -11.4MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-02-20 16:20:33,851 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory was 59.5MB in the beginning and 59.4MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:20:33,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.46ms. Allocated memory is still 102.8MB. Free memory was 72.6MB in the beginning and 71.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:20:33,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.44ms. Allocated memory is still 102.8MB. Free memory was 71.5MB in the beginning and 69.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:20:33,852 INFO L158 Benchmark]: Boogie Preprocessor took 34.50ms. Allocated memory is still 102.8MB. Free memory was 69.6MB in the beginning and 68.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:20:33,853 INFO L158 Benchmark]: RCFGBuilder took 336.61ms. Allocated memory is still 102.8MB. Free memory was 68.3MB in the beginning and 55.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:20:33,853 INFO L158 Benchmark]: TraceAbstraction took 338.27ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 54.7MB in the beginning and 84.2MB in the end (delta: -29.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:20:33,855 INFO L158 Benchmark]: Witness Printer took 5.22ms. Allocated memory is still 123.7MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:20:33,857 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 102.8MB. Free memory was 59.5MB in the beginning and 59.4MB in the end (delta: 49.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.46ms. Allocated memory is still 102.8MB. Free memory was 72.6MB in the beginning and 71.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.44ms. Allocated memory is still 102.8MB. Free memory was 71.5MB in the beginning and 69.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.50ms. Allocated memory is still 102.8MB. Free memory was 69.6MB in the beginning and 68.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 336.61ms. Allocated memory is still 102.8MB. Free memory was 68.3MB in the beginning and 55.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 338.27ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 54.7MB in the beginning and 84.2MB in the end (delta: -29.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.22ms. Allocated memory is still 123.7MB. Free memory is still 84.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 9. Possible FailurePath: [L9] COND TRUE !(1.0!=2.0) [L9] reach_error() - UnprovableResult [Line: 10]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:20:33,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-cbmc-regression/float6.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 fd27604fe9b1767824ea9ccd6f7ecdb4d002f9be3c28c3385ab6133c7bd8f97d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:20:35,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:20:35,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:20:35,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:20:35,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:20:35,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:20:35,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:20:35,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:20:35,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:20:35,795 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:20:35,796 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:20:35,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:20:35,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:20:35,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:20:35,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:20:35,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:20:35,809 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:20:35,809 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:20:35,811 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:20:35,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:20:35,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:20:35,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:20:35,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:20:35,819 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:20:35,821 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:20:35,821 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:20:35,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:20:35,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:20:35,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:20:35,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:20:35,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:20:35,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:20:35,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:20:35,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:20:35,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:20:35,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:20:35,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:20:35,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:20:35,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:20:35,828 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:20:35,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:20:35,831 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:20:35,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:20:35,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:20:35,869 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:20:35,869 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:20:35,870 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:20:35,870 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:20:35,871 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:20:35,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:20:35,872 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:20:35,872 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:20:35,873 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:20:35,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:20:35,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:20:35,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:20:35,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:20:35,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:20:35,874 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:20:35,874 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:20:35,874 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:20:35,874 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:20:35,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:20:35,874 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:20:35,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:20:35,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:20:35,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:20:35,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:20:35,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:20:35,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:20:35,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:20:35,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:20:35,876 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:20:35,876 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:20:35,877 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:20:35,877 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:20:35,877 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:20:35,877 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:20:35,877 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 -> fd27604fe9b1767824ea9ccd6f7ecdb4d002f9be3c28c3385ab6133c7bd8f97d [2022-02-20 16:20:36,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:20:36,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:20:36,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:20:36,201 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:20:36,202 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:20:36,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float6.c [2022-02-20 16:20:36,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f88e656/7623433a0e5b4c619f7821b6c16946f5/FLAGfd1877f71 [2022-02-20 16:20:36,665 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:20:36,666 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c [2022-02-20 16:20:36,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f88e656/7623433a0e5b4c619f7821b6c16946f5/FLAGfd1877f71 [2022-02-20 16:20:36,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73f88e656/7623433a0e5b4c619f7821b6c16946f5 [2022-02-20 16:20:36,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:20:36,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:20:36,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:20:36,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:20:36,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:20:36,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:20:36" (1/1) ... [2022-02-20 16:20:36,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50423d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:36, skipping insertion in model container [2022-02-20 16:20:36,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:20:36" (1/1) ... [2022-02-20 16:20:36,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:20:36,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:20:36,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[369,382] [2022-02-20 16:20:36,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[412,425] [2022-02-20 16:20:36,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[454,467] [2022-02-20 16:20:36,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[501,514] [2022-02-20 16:20:36,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[543,556] [2022-02-20 16:20:36,879 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[590,603] [2022-02-20 16:20:36,880 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[635,648] [2022-02-20 16:20:36,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[682,695] [2022-02-20 16:20:36,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[727,740] [2022-02-20 16:20:36,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[774,787] [2022-02-20 16:20:36,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[817,830] [2022-02-20 16:20:36,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[862,875] [2022-02-20 16:20:36,892 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[905,918] [2022-02-20 16:20:36,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[950,963] [2022-02-20 16:20:36,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[993,1006] [2022-02-20 16:20:36,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1041,1054] [2022-02-20 16:20:36,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1084,1097] [2022-02-20 16:20:36,901 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1132,1145] [2022-02-20 16:20:36,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1291,1304] [2022-02-20 16:20:36,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1330,1343] [2022-02-20 16:20:36,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1368,1381] [2022-02-20 16:20:36,907 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1411,1424] [2022-02-20 16:20:36,908 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1449,1462] [2022-02-20 16:20:36,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1492,1505] [2022-02-20 16:20:36,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1533,1546] [2022-02-20 16:20:36,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1576,1589] [2022-02-20 16:20:36,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1617,1630] [2022-02-20 16:20:36,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1660,1673] [2022-02-20 16:20:36,911 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1699,1712] [2022-02-20 16:20:36,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1740,1753] [2022-02-20 16:20:36,912 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1779,1792] [2022-02-20 16:20:36,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1820,1833] [2022-02-20 16:20:36,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1859,1872] [2022-02-20 16:20:36,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1903,1916] [2022-02-20 16:20:36,914 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1942,1955] [2022-02-20 16:20:36,915 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1986,1999] [2022-02-20 16:20:36,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:20:36,967 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:20:36,981 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[369,382] [2022-02-20 16:20:36,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[412,425] [2022-02-20 16:20:36,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[454,467] [2022-02-20 16:20:36,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[501,514] [2022-02-20 16:20:36,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[543,556] [2022-02-20 16:20:36,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[590,603] [2022-02-20 16:20:36,989 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[635,648] [2022-02-20 16:20:36,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[682,695] [2022-02-20 16:20:36,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[727,740] [2022-02-20 16:20:36,995 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[774,787] [2022-02-20 16:20:36,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[817,830] [2022-02-20 16:20:36,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[862,875] [2022-02-20 16:20:36,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[905,918] [2022-02-20 16:20:36,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[950,963] [2022-02-20 16:20:37,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[993,1006] [2022-02-20 16:20:37,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1041,1054] [2022-02-20 16:20:37,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1084,1097] [2022-02-20 16:20:37,007 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1132,1145] [2022-02-20 16:20:37,009 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1291,1304] [2022-02-20 16:20:37,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1330,1343] [2022-02-20 16:20:37,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1368,1381] [2022-02-20 16:20:37,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1411,1424] [2022-02-20 16:20:37,016 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1449,1462] [2022-02-20 16:20:37,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1492,1505] [2022-02-20 16:20:37,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1533,1546] [2022-02-20 16:20:37,018 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1576,1589] [2022-02-20 16:20:37,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1617,1630] [2022-02-20 16:20:37,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1660,1673] [2022-02-20 16:20:37,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1699,1712] [2022-02-20 16:20:37,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1740,1753] [2022-02-20 16:20:37,025 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1779,1792] [2022-02-20 16:20:37,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1820,1833] [2022-02-20 16:20:37,026 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1859,1872] [2022-02-20 16:20:37,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1903,1916] [2022-02-20 16:20:37,027 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1942,1955] [2022-02-20 16:20:37,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1986,1999] [2022-02-20 16:20:37,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:20:37,042 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:20:37,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37 WrapperNode [2022-02-20 16:20:37,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:20:37,048 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:20:37,048 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:20:37,048 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:20:37,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,075 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,107 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2022-02-20 16:20:37,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:20:37,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:20:37,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:20:37,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:20:37,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,137 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:20:37,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:20:37,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:20:37,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:20:37,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (1/1) ... [2022-02-20 16:20:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:20:37,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:20:37,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:20:37,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:20:37,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:20:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:20:37,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:20:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:20:37,288 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:20:37,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:20:37,506 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:20:37,511 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:20:37,511 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:20:37,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:20:37 BoogieIcfgContainer [2022-02-20 16:20:37,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:20:37,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:20:37,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:20:37,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:20:37,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:20:36" (1/3) ... [2022-02-20 16:20:37,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383bdb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:20:37, skipping insertion in model container [2022-02-20 16:20:37,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:20:37" (2/3) ... [2022-02-20 16:20:37,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383bdb81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:20:37, skipping insertion in model container [2022-02-20 16:20:37,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:20:37" (3/3) ... [2022-02-20 16:20:37,519 INFO L111 eAbstractionObserver]: Analyzing ICFG float6.c [2022-02-20 16:20:37,523 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:20:37,523 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-02-20 16:20:37,557 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:20:37,562 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:20:37,562 INFO L340 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-02-20 16:20:37,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 78 states have (on average 1.935897435897436) internal successors, (151), 114 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 16:20:37,581 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:37,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 16:20:37,582 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:37,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:37,620 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-02-20 16:20:37,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:37,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773653055] [2022-02-20 16:20:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:37,633 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:37,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:37,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:37,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:20:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:37,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:20:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:37,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:37,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {118#true} is VALID [2022-02-20 16:20:37,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {118#true} is VALID [2022-02-20 16:20:37,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {119#false} is VALID [2022-02-20 16:20:37,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-02-20 16:20:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:37,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:37,766 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:37,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773653055] [2022-02-20 16:20:37,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773653055] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:37,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:37,774 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:20:37,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118374159] [2022-02-20 16:20:37,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:37,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 16:20:37,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:37,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:37,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:37,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:20:37,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:37,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:20:37,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:20:37,818 INFO L87 Difference]: Start difference. First operand has 115 states, 78 states have (on average 1.935897435897436) internal successors, (151), 114 states have internal predecessors, (151), 0 states have call successors, (0), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:37,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:37,962 INFO L93 Difference]: Finished difference Result 183 states and 254 transitions. [2022-02-20 16:20:37,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:20:37,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 16:20:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 254 transitions. [2022-02-20 16:20:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 254 transitions. [2022-02-20 16:20:37,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 254 transitions. [2022-02-20 16:20:38,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:38,245 INFO L225 Difference]: With dead ends: 183 [2022-02-20 16:20:38,246 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 16:20:38,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:20:38,254 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:38,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:20:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 16:20:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-02-20 16:20:38,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:38,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 67 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,285 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 67 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,286 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 67 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:38,293 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2022-02-20 16:20:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2022-02-20 16:20:38,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:38,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:38,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 67 states have internal predecessors, (67), 0 states have call successors, (0), 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 68 states. [2022-02-20 16:20:38,295 INFO L87 Difference]: Start difference. First operand has 68 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 67 states have internal predecessors, (67), 0 states have call successors, (0), 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 68 states. [2022-02-20 16:20:38,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:38,303 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2022-02-20 16:20:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2022-02-20 16:20:38,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:38,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:38,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:38,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 67 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2022-02-20 16:20:38,314 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 4 [2022-02-20 16:20:38,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:38,315 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2022-02-20 16:20:38,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,315 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2022-02-20 16:20:38,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:20:38,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:38,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:38,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:20:38,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:38,517 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash 271685265, now seen corresponding path program 1 times [2022-02-20 16:20:38,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:38,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450584214] [2022-02-20 16:20:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:38,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:38,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:38,520 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:38,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:20:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:38,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:20:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:38,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:38,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {518#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {518#true} is VALID [2022-02-20 16:20:38,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {518#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {518#true} is VALID [2022-02-20 16:20:38,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {518#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {518#true} is VALID [2022-02-20 16:20:38,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {518#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {518#true} is VALID [2022-02-20 16:20:38,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {518#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {518#true} is VALID [2022-02-20 16:20:38,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {518#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {518#true} is VALID [2022-02-20 16:20:38,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {518#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {518#true} is VALID [2022-02-20 16:20:38,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {518#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {518#true} is VALID [2022-02-20 16:20:38,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {518#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {518#true} is VALID [2022-02-20 16:20:38,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {518#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {518#true} is VALID [2022-02-20 16:20:38,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {518#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {518#true} is VALID [2022-02-20 16:20:38,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {518#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {518#true} is VALID [2022-02-20 16:20:38,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {518#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {518#true} is VALID [2022-02-20 16:20:38,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {518#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {518#true} is VALID [2022-02-20 16:20:38,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {518#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {518#true} is VALID [2022-02-20 16:20:38,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {518#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {518#true} is VALID [2022-02-20 16:20:38,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {518#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {518#true} is VALID [2022-02-20 16:20:38,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {518#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {518#true} is VALID [2022-02-20 16:20:38,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {518#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {518#true} is VALID [2022-02-20 16:20:38,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {518#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {518#true} is VALID [2022-02-20 16:20:38,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {518#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {518#true} is VALID [2022-02-20 16:20:38,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {518#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {586#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:38,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {586#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {519#false} is VALID [2022-02-20 16:20:38,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {519#false} assume !false; {519#false} is VALID [2022-02-20 16:20:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:38,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:38,682 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:38,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450584214] [2022-02-20 16:20:38,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450584214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:38,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:38,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:38,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104763673] [2022-02-20 16:20:38,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:38,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:20:38,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:38,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:38,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:38,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:38,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:38,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:38,715 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:38,872 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2022-02-20 16:20:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:38,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:20:38,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 16:20:38,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 16:20:38,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2022-02-20 16:20:38,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:38,951 INFO L225 Difference]: With dead ends: 68 [2022-02-20 16:20:38,951 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 16:20:38,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:38,952 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:38,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-02-20 16:20:38,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 16:20:38,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 16:20:38,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:38,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 65 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,957 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 65 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,957 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 65 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:38,959 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2022-02-20 16:20:38,959 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 65 transitions. [2022-02-20 16:20:38,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:38,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:38,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 65 states have internal predecessors, (65), 0 states have call successors, (0), 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 66 states. [2022-02-20 16:20:38,965 INFO L87 Difference]: Start difference. First operand has 66 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 65 states have internal predecessors, (65), 0 states have call successors, (0), 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 66 states. [2022-02-20 16:20:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:38,968 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2022-02-20 16:20:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 65 transitions. [2022-02-20 16:20:38,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:38,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:38,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:38,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 65 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 65 transitions. [2022-02-20 16:20:38,977 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 65 transitions. Word has length 24 [2022-02-20 16:20:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:38,978 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 65 transitions. [2022-02-20 16:20:38,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 65 transitions. [2022-02-20 16:20:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:20:38,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:38,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:38,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:20:39,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:39,188 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash -167687151, now seen corresponding path program 1 times [2022-02-20 16:20:39,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:39,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451881583] [2022-02-20 16:20:39,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:39,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:39,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:39,192 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:39,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:20:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:39,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:20:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:39,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:39,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {858#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {858#true} is VALID [2022-02-20 16:20:39,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {858#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {858#true} is VALID [2022-02-20 16:20:39,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {858#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {858#true} is VALID [2022-02-20 16:20:39,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {858#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {858#true} is VALID [2022-02-20 16:20:39,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {858#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {858#true} is VALID [2022-02-20 16:20:39,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {858#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {858#true} is VALID [2022-02-20 16:20:39,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {858#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {858#true} is VALID [2022-02-20 16:20:39,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {858#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {858#true} is VALID [2022-02-20 16:20:39,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {858#true} is VALID [2022-02-20 16:20:39,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {858#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {858#true} is VALID [2022-02-20 16:20:39,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {858#true} is VALID [2022-02-20 16:20:39,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {858#true} is VALID [2022-02-20 16:20:39,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {858#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {858#true} is VALID [2022-02-20 16:20:39,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {858#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {858#true} is VALID [2022-02-20 16:20:39,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {858#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {858#true} is VALID [2022-02-20 16:20:39,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {858#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {858#true} is VALID [2022-02-20 16:20:39,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {858#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {858#true} is VALID [2022-02-20 16:20:39,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {858#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {858#true} is VALID [2022-02-20 16:20:39,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {858#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {858#true} is VALID [2022-02-20 16:20:39,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {858#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {858#true} is VALID [2022-02-20 16:20:39,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {858#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {858#true} is VALID [2022-02-20 16:20:39,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {858#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {926#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))))} is VALID [2022-02-20 16:20:39,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {926#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {926#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))))} is VALID [2022-02-20 16:20:39,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {926#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))))} assume !~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {859#false} is VALID [2022-02-20 16:20:39,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {859#false} assume !false; {859#false} is VALID [2022-02-20 16:20:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:39,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:39,334 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:39,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451881583] [2022-02-20 16:20:39,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451881583] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:39,335 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:39,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:39,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902156501] [2022-02-20 16:20:39,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 16:20:39,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:39,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:39,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:39,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:39,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:39,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:39,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:39,372 INFO L87 Difference]: Start difference. First operand 66 states and 65 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:39,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:39,505 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2022-02-20 16:20:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:39,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 16:20:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:39,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 16:20:39,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:39,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 16:20:39,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-02-20 16:20:39,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:39,579 INFO L225 Difference]: With dead ends: 66 [2022-02-20 16:20:39,579 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 16:20:39,580 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:39,581 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:39,581 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-02-20 16:20:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 16:20:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-20 16:20:39,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:39,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 63 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:39,588 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 63 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:39,588 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 63 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:39,590 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2022-02-20 16:20:39,590 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2022-02-20 16:20:39,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:39,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:39,593 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 63 states have internal predecessors, (63), 0 states have call successors, (0), 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 64 states. [2022-02-20 16:20:39,593 INFO L87 Difference]: Start difference. First operand has 64 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 63 states have internal predecessors, (63), 0 states have call successors, (0), 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 64 states. [2022-02-20 16:20:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:39,596 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2022-02-20 16:20:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2022-02-20 16:20:39,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:39,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:39,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:39,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 63 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:39,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2022-02-20 16:20:39,599 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 25 [2022-02-20 16:20:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:39,599 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2022-02-20 16:20:39,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:39,599 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2022-02-20 16:20:39,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 16:20:39,600 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:39,600 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:39,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:39,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:39,808 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:39,809 INFO L85 PathProgramCache]: Analyzing trace with hash -903330151, now seen corresponding path program 1 times [2022-02-20 16:20:39,809 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:39,809 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026081776] [2022-02-20 16:20:39,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:39,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:39,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:39,812 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:39,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:20:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:39,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:20:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:39,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:39,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {1193#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1193#true} is VALID [2022-02-20 16:20:39,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {1193#true} is VALID [2022-02-20 16:20:39,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {1193#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1193#true} is VALID [2022-02-20 16:20:39,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {1193#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {1193#true} is VALID [2022-02-20 16:20:39,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {1193#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1193#true} is VALID [2022-02-20 16:20:39,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {1193#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1193#true} is VALID [2022-02-20 16:20:39,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {1193#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {1193#true} is VALID [2022-02-20 16:20:39,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1193#true} is VALID [2022-02-20 16:20:39,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {1193#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1193#true} is VALID [2022-02-20 16:20:39,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {1193#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1193#true} is VALID [2022-02-20 16:20:39,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {1193#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1193#true} is VALID [2022-02-20 16:20:39,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {1193#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1193#true} is VALID [2022-02-20 16:20:39,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {1193#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1193#true} is VALID [2022-02-20 16:20:39,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {1193#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1193#true} is VALID [2022-02-20 16:20:39,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {1193#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1193#true} is VALID [2022-02-20 16:20:39,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {1193#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1193#true} is VALID [2022-02-20 16:20:39,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {1193#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1193#true} is VALID [2022-02-20 16:20:39,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {1193#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1193#true} is VALID [2022-02-20 16:20:39,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {1193#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {1193#true} is VALID [2022-02-20 16:20:39,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {1193#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1193#true} is VALID [2022-02-20 16:20:39,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {1193#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1193#true} is VALID [2022-02-20 16:20:39,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {1193#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {1261#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:39,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {1261#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {1261#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:39,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {1261#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {1261#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:39,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {1194#false} is VALID [2022-02-20 16:20:39,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {1194#false} assume !false; {1194#false} is VALID [2022-02-20 16:20:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:39,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:39,979 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:39,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026081776] [2022-02-20 16:20:39,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026081776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:39,980 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:39,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:39,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51108587] [2022-02-20 16:20:39,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:39,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Word has length 26 [2022-02-20 16:20:39,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:39,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) [2022-02-20 16:20:40,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:40,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:40,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:40,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:40,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:40,015 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) [2022-02-20 16:20:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:40,136 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2022-02-20 16:20:40,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:40,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Word has length 26 [2022-02-20 16:20:40,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) [2022-02-20 16:20:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 16:20:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) [2022-02-20 16:20:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 16:20:40,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-02-20 16:20:40,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:40,209 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:20:40,209 INFO L226 Difference]: Without dead ends: 62 [2022-02-20 16:20:40,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:40,210 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:40,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2022-02-20 16:20:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-20 16:20:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-02-20 16:20:40,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:40,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 61 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:40,215 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 61 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:40,215 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 61 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:40,217 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2022-02-20 16:20:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 61 transitions. [2022-02-20 16:20:40,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:40,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:40,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 61 states have internal predecessors, (61), 0 states have call successors, (0), 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 62 states. [2022-02-20 16:20:40,218 INFO L87 Difference]: Start difference. First operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 61 states have internal predecessors, (61), 0 states have call successors, (0), 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 62 states. [2022-02-20 16:20:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:40,219 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2022-02-20 16:20:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 61 transitions. [2022-02-20 16:20:40,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:40,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:40,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:40,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 61 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 61 transitions. [2022-02-20 16:20:40,222 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 61 transitions. Word has length 26 [2022-02-20 16:20:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:40,222 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 61 transitions. [2022-02-20 16:20:40,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) [2022-02-20 16:20:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 61 transitions. [2022-02-20 16:20:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 16:20:40,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:40,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:40,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:40,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:40,433 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2061540633, now seen corresponding path program 1 times [2022-02-20 16:20:40,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:40,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877246215] [2022-02-20 16:20:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:40,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:40,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:40,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:40,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:20:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:40,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:20:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:40,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:40,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {1523#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1523#true} is VALID [2022-02-20 16:20:40,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {1523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {1523#true} is VALID [2022-02-20 16:20:40,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {1523#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1523#true} is VALID [2022-02-20 16:20:40,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {1523#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {1523#true} is VALID [2022-02-20 16:20:40,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {1523#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1523#true} is VALID [2022-02-20 16:20:40,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {1523#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1523#true} is VALID [2022-02-20 16:20:40,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {1523#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {1523#true} is VALID [2022-02-20 16:20:40,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {1523#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1523#true} is VALID [2022-02-20 16:20:40,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {1523#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1523#true} is VALID [2022-02-20 16:20:40,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {1523#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1523#true} is VALID [2022-02-20 16:20:40,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {1523#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1523#true} is VALID [2022-02-20 16:20:40,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {1523#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1523#true} is VALID [2022-02-20 16:20:40,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {1523#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1523#true} is VALID [2022-02-20 16:20:40,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {1523#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1523#true} is VALID [2022-02-20 16:20:40,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {1523#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1523#true} is VALID [2022-02-20 16:20:40,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {1523#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1523#true} is VALID [2022-02-20 16:20:40,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {1523#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1523#true} is VALID [2022-02-20 16:20:40,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {1523#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1523#true} is VALID [2022-02-20 16:20:40,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {1523#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {1523#true} is VALID [2022-02-20 16:20:40,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {1523#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1523#true} is VALID [2022-02-20 16:20:40,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {1523#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1523#true} is VALID [2022-02-20 16:20:40,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {1523#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {1591#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:40,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {1591#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {1591#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:40,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {1591#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {1591#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:40,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {1591#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {1591#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:40,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {1591#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {1524#false} is VALID [2022-02-20 16:20:40,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {1524#false} assume !false; {1524#false} is VALID [2022-02-20 16:20:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:40,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:40,631 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:40,631 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877246215] [2022-02-20 16:20:40,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877246215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:40,631 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:40,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:40,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490774607] [2022-02-20 16:20:40,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:40,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) Word has length 27 [2022-02-20 16:20:40,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:40,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2022-02-20 16:20:40,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:40,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:40,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:40,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:40,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:40,670 INFO L87 Difference]: Start difference. First operand 62 states and 61 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2022-02-20 16:20:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:40,775 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2022-02-20 16:20:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:40,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) Word has length 27 [2022-02-20 16:20:40,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2022-02-20 16:20:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-02-20 16:20:40,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2022-02-20 16:20:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-02-20 16:20:40,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 61 transitions. [2022-02-20 16:20:40,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:40,843 INFO L225 Difference]: With dead ends: 62 [2022-02-20 16:20:40,843 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 16:20:40,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:40,844 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:40,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 29 Unchecked, 0.0s Time] [2022-02-20 16:20:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 16:20:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 16:20:40,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:40,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 59 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:40,847 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 59 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:40,848 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 59 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:40,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:40,849 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2022-02-20 16:20:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 59 transitions. [2022-02-20 16:20:40,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:40,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:40,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 59 states have internal predecessors, (59), 0 states have call successors, (0), 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 60 states. [2022-02-20 16:20:40,850 INFO L87 Difference]: Start difference. First operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 59 states have internal predecessors, (59), 0 states have call successors, (0), 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 60 states. [2022-02-20 16:20:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:40,851 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2022-02-20 16:20:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 59 transitions. [2022-02-20 16:20:40,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:40,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:40,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:40,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 59 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 59 transitions. [2022-02-20 16:20:40,853 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 59 transitions. Word has length 27 [2022-02-20 16:20:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:40,853 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 59 transitions. [2022-02-20 16:20:40,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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) [2022-02-20 16:20:40,854 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 59 transitions. [2022-02-20 16:20:40,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 16:20:40,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:40,854 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:40,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:41,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:41,064 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:41,064 INFO L85 PathProgramCache]: Analyzing trace with hash -516745567, now seen corresponding path program 1 times [2022-02-20 16:20:41,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:41,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193780502] [2022-02-20 16:20:41,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:41,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:41,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:41,066 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:41,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:20:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:41,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:20:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:41,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:41,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {1848#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1848#true} is VALID [2022-02-20 16:20:41,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {1848#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {1848#true} is VALID [2022-02-20 16:20:41,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {1848#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1848#true} is VALID [2022-02-20 16:20:41,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {1848#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {1848#true} is VALID [2022-02-20 16:20:41,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {1848#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1848#true} is VALID [2022-02-20 16:20:41,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {1848#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1848#true} is VALID [2022-02-20 16:20:41,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {1848#true} is VALID [2022-02-20 16:20:41,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {1848#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1848#true} is VALID [2022-02-20 16:20:41,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {1848#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1848#true} is VALID [2022-02-20 16:20:41,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {1848#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1848#true} is VALID [2022-02-20 16:20:41,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {1848#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1848#true} is VALID [2022-02-20 16:20:41,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {1848#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1848#true} is VALID [2022-02-20 16:20:41,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {1848#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1848#true} is VALID [2022-02-20 16:20:41,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {1848#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1848#true} is VALID [2022-02-20 16:20:41,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {1848#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1848#true} is VALID [2022-02-20 16:20:41,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {1848#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1848#true} is VALID [2022-02-20 16:20:41,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {1848#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {1848#true} is VALID [2022-02-20 16:20:41,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {1848#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {1848#true} is VALID [2022-02-20 16:20:41,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {1848#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {1848#true} is VALID [2022-02-20 16:20:41,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {1848#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1848#true} is VALID [2022-02-20 16:20:41,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {1848#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1848#true} is VALID [2022-02-20 16:20:41,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {1848#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {1916#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {1849#false} is VALID [2022-02-20 16:20:41,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {1849#false} assume !false; {1849#false} is VALID [2022-02-20 16:20:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:41,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:41,256 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:41,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193780502] [2022-02-20 16:20:41,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193780502] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:41,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:41,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:41,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134619966] [2022-02-20 16:20:41,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:41,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-20 16:20:41,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:41,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:41,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:41,298 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:41,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:41,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:41,299 INFO L87 Difference]: Start difference. First operand 60 states and 59 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:41,401 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2022-02-20 16:20:41,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:41,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-20 16:20:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:41,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-20 16:20:41,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-02-20 16:20:41,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 59 transitions. [2022-02-20 16:20:41,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:41,470 INFO L225 Difference]: With dead ends: 60 [2022-02-20 16:20:41,470 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 16:20:41,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:41,471 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:41,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-02-20 16:20:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 16:20:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-20 16:20:41,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:41,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 57 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,475 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 57 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,475 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 57 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:41,476 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2022-02-20 16:20:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 57 transitions. [2022-02-20 16:20:41,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:41,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:41,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 57 states have internal predecessors, (57), 0 states have call successors, (0), 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 58 states. [2022-02-20 16:20:41,477 INFO L87 Difference]: Start difference. First operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 57 states have internal predecessors, (57), 0 states have call successors, (0), 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 58 states. [2022-02-20 16:20:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:41,478 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2022-02-20 16:20:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 57 transitions. [2022-02-20 16:20:41,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:41,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:41,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:41,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:41,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 57 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 57 transitions. [2022-02-20 16:20:41,483 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 57 transitions. Word has length 28 [2022-02-20 16:20:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:41,485 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 57 transitions. [2022-02-20 16:20:41,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 57 transitions. [2022-02-20 16:20:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 16:20:41,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:41,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:41,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:41,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:41,687 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:41,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1160760865, now seen corresponding path program 1 times [2022-02-20 16:20:41,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:41,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886923120] [2022-02-20 16:20:41,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:41,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:41,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:41,689 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:41,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:20:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:41,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:20:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:41,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:41,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {2168#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {2168#true} is VALID [2022-02-20 16:20:41,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {2168#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {2168#true} is VALID [2022-02-20 16:20:41,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {2168#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2168#true} is VALID [2022-02-20 16:20:41,858 INFO L290 TraceCheckUtils]: 3: Hoare triple {2168#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {2168#true} is VALID [2022-02-20 16:20:41,858 INFO L290 TraceCheckUtils]: 4: Hoare triple {2168#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2168#true} is VALID [2022-02-20 16:20:41,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {2168#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2168#true} is VALID [2022-02-20 16:20:41,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {2168#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {2168#true} is VALID [2022-02-20 16:20:41,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {2168#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {2168#true} is VALID [2022-02-20 16:20:41,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {2168#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2168#true} is VALID [2022-02-20 16:20:41,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {2168#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2168#true} is VALID [2022-02-20 16:20:41,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {2168#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2168#true} is VALID [2022-02-20 16:20:41,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {2168#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2168#true} is VALID [2022-02-20 16:20:41,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {2168#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2168#true} is VALID [2022-02-20 16:20:41,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {2168#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2168#true} is VALID [2022-02-20 16:20:41,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {2168#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2168#true} is VALID [2022-02-20 16:20:41,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {2168#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2168#true} is VALID [2022-02-20 16:20:41,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {2168#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2168#true} is VALID [2022-02-20 16:20:41,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {2168#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2168#true} is VALID [2022-02-20 16:20:41,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {2168#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {2168#true} is VALID [2022-02-20 16:20:41,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {2168#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {2168#true} is VALID [2022-02-20 16:20:41,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {2168#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2168#true} is VALID [2022-02-20 16:20:41,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {2168#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,863 INFO L290 TraceCheckUtils]: 22: Hoare triple {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:41,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {2236#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {2169#false} is VALID [2022-02-20 16:20:41,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {2169#false} assume !false; {2169#false} is VALID [2022-02-20 16:20:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:41,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:41,873 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:41,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886923120] [2022-02-20 16:20:41,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886923120] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:41,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:41,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:41,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035992835] [2022-02-20 16:20:41,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 16:20:41,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:41,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:41,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:41,917 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:41,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:41,917 INFO L87 Difference]: Start difference. First operand 58 states and 57 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:41,991 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2022-02-20 16:20:41,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:41,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-02-20 16:20:41,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-02-20 16:20:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-02-20 16:20:41,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2022-02-20 16:20:42,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:42,050 INFO L225 Difference]: With dead ends: 58 [2022-02-20 16:20:42,050 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 16:20:42,051 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:42,051 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:42,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2022-02-20 16:20:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 16:20:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 16:20:42,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:42,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:42,054 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:42,055 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:42,056 INFO L93 Difference]: Finished difference Result 56 states and 55 transitions. [2022-02-20 16:20:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 55 transitions. [2022-02-20 16:20:42,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:42,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:42,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 states. [2022-02-20 16:20:42,056 INFO L87 Difference]: Start difference. First operand has 56 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 0 states have call successors, (0), 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 56 states. [2022-02-20 16:20:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:42,064 INFO L93 Difference]: Finished difference Result 56 states and 55 transitions. [2022-02-20 16:20:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 55 transitions. [2022-02-20 16:20:42,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:42,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:42,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:42,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 55 transitions. [2022-02-20 16:20:42,066 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 55 transitions. Word has length 29 [2022-02-20 16:20:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:42,066 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 55 transitions. [2022-02-20 16:20:42,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 55 transitions. [2022-02-20 16:20:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 16:20:42,068 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:42,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:42,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:42,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:42,279 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1367099065, now seen corresponding path program 1 times [2022-02-20 16:20:42,279 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:42,279 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377759086] [2022-02-20 16:20:42,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:42,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:42,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:42,280 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:42,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 16:20:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:42,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:20:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:42,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:42,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {2483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {2483#true} is VALID [2022-02-20 16:20:42,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {2483#true} is VALID [2022-02-20 16:20:42,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {2483#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2483#true} is VALID [2022-02-20 16:20:42,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {2483#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {2483#true} is VALID [2022-02-20 16:20:42,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {2483#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2483#true} is VALID [2022-02-20 16:20:42,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {2483#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2483#true} is VALID [2022-02-20 16:20:42,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {2483#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {2483#true} is VALID [2022-02-20 16:20:42,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {2483#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {2483#true} is VALID [2022-02-20 16:20:42,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {2483#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2483#true} is VALID [2022-02-20 16:20:42,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2483#true} is VALID [2022-02-20 16:20:42,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {2483#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2483#true} is VALID [2022-02-20 16:20:42,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {2483#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2483#true} is VALID [2022-02-20 16:20:42,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {2483#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2483#true} is VALID [2022-02-20 16:20:42,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {2483#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2483#true} is VALID [2022-02-20 16:20:42,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {2483#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2483#true} is VALID [2022-02-20 16:20:42,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {2483#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2483#true} is VALID [2022-02-20 16:20:42,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {2483#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2483#true} is VALID [2022-02-20 16:20:42,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {2483#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2483#true} is VALID [2022-02-20 16:20:42,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {2483#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {2483#true} is VALID [2022-02-20 16:20:42,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {2483#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {2483#true} is VALID [2022-02-20 16:20:42,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {2483#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2483#true} is VALID [2022-02-20 16:20:42,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {2483#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(main_~b~0#1, main_~b~0#1); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(main_~b~0#1, main_~b~0#1); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:42,439 INFO L290 TraceCheckUtils]: 32: Hoare triple {2551#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !~fp.leq~FLOAT(main_~b~0#1, main_~b~0#1); {2484#false} is VALID [2022-02-20 16:20:42,440 INFO L290 TraceCheckUtils]: 33: Hoare triple {2484#false} assume !false; {2484#false} is VALID [2022-02-20 16:20:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:42,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:42,440 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:42,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377759086] [2022-02-20 16:20:42,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377759086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:42,441 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:42,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:42,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198885819] [2022-02-20 16:20:42,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:42,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 34 [2022-02-20 16:20:42,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:42,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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) [2022-02-20 16:20:42,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:42,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:42,494 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:42,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:42,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:42,495 INFO L87 Difference]: Start difference. First operand 56 states and 55 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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) [2022-02-20 16:20:42,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:42,573 INFO L93 Difference]: Finished difference Result 56 states and 55 transitions. [2022-02-20 16:20:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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 34 [2022-02-20 16:20:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:42,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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) [2022-02-20 16:20:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 16:20:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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) [2022-02-20 16:20:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-02-20 16:20:42,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-02-20 16:20:42,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:42,629 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:20:42,629 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 16:20:42,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:42,630 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:42,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-02-20 16:20:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 16:20:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-20 16:20:42,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:42,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:42,633 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:42,633 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:42,634 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2022-02-20 16:20:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2022-02-20 16:20:42,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:42,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:42,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-20 16:20:42,635 INFO L87 Difference]: Start difference. First operand has 54 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-20 16:20:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:42,636 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2022-02-20 16:20:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2022-02-20 16:20:42,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:42,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:42,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:42,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:42,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:42,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 53 transitions. [2022-02-20 16:20:42,643 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 53 transitions. Word has length 34 [2022-02-20 16:20:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:42,643 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 53 transitions. [2022-02-20 16:20:42,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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) [2022-02-20 16:20:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2022-02-20 16:20:42,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 16:20:42,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:42,644 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:42,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:42,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:42,854 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:42,855 INFO L85 PathProgramCache]: Analyzing trace with hash -569597639, now seen corresponding path program 1 times [2022-02-20 16:20:42,855 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:42,855 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2112491645] [2022-02-20 16:20:42,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:42,855 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:42,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:42,856 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:42,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 16:20:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:42,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:20:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:42,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:43,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {2805#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {2805#true} is VALID [2022-02-20 16:20:43,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {2805#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {2805#true} is VALID [2022-02-20 16:20:43,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {2805#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2805#true} is VALID [2022-02-20 16:20:43,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {2805#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {2805#true} is VALID [2022-02-20 16:20:43,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {2805#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2805#true} is VALID [2022-02-20 16:20:43,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {2805#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2805#true} is VALID [2022-02-20 16:20:43,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {2805#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {2805#true} is VALID [2022-02-20 16:20:43,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {2805#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {2805#true} is VALID [2022-02-20 16:20:43,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {2805#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2805#true} is VALID [2022-02-20 16:20:43,009 INFO L290 TraceCheckUtils]: 9: Hoare triple {2805#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2805#true} is VALID [2022-02-20 16:20:43,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {2805#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2805#true} is VALID [2022-02-20 16:20:43,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {2805#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2805#true} is VALID [2022-02-20 16:20:43,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {2805#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2805#true} is VALID [2022-02-20 16:20:43,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {2805#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2805#true} is VALID [2022-02-20 16:20:43,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {2805#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2805#true} is VALID [2022-02-20 16:20:43,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {2805#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2805#true} is VALID [2022-02-20 16:20:43,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {2805#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {2805#true} is VALID [2022-02-20 16:20:43,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {2805#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {2805#true} is VALID [2022-02-20 16:20:43,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {2805#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {2805#true} is VALID [2022-02-20 16:20:43,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {2805#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {2805#true} is VALID [2022-02-20 16:20:43,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {2805#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2805#true} is VALID [2022-02-20 16:20:43,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {2805#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,014 INFO L290 TraceCheckUtils]: 23: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,015 INFO L290 TraceCheckUtils]: 24: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,015 INFO L290 TraceCheckUtils]: 25: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(main_~b~0#1, main_~b~0#1); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(main_~b~0#1, main_~b~0#1); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.leq~FLOAT(main_~b~0#1, main_~b~0#1); {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {2873#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !~fp.leq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {2806#false} is VALID [2022-02-20 16:20:43,020 INFO L290 TraceCheckUtils]: 34: Hoare triple {2806#false} assume !false; {2806#false} is VALID [2022-02-20 16:20:43,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:43,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:43,020 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:43,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2112491645] [2022-02-20 16:20:43,020 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2112491645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:43,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:43,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:43,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123435303] [2022-02-20 16:20:43,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-02-20 16:20:43,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:43,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:43,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:43,070 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:43,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:43,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:43,070 INFO L87 Difference]: Start difference. First operand 54 states and 53 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:43,131 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2022-02-20 16:20:43,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:43,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2022-02-20 16:20:43,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:43,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-02-20 16:20:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-02-20 16:20:43,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2022-02-20 16:20:43,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:43,183 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:20:43,183 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 16:20:43,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:43,184 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:43,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-02-20 16:20:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 16:20:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-20 16:20:43,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:43,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 46 states have (on average 1.108695652173913) internal successors, (51), 51 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,187 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 46 states have (on average 1.108695652173913) internal successors, (51), 51 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,187 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 46 states have (on average 1.108695652173913) internal successors, (51), 51 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:43,188 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2022-02-20 16:20:43,188 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2022-02-20 16:20:43,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:43,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:43,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 46 states have (on average 1.108695652173913) internal successors, (51), 51 states have internal predecessors, (51), 0 states have call successors, (0), 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 52 states. [2022-02-20 16:20:43,189 INFO L87 Difference]: Start difference. First operand has 52 states, 46 states have (on average 1.108695652173913) internal successors, (51), 51 states have internal predecessors, (51), 0 states have call successors, (0), 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 52 states. [2022-02-20 16:20:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:43,190 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2022-02-20 16:20:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2022-02-20 16:20:43,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:43,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:43,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:43,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:43,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.108695652173913) internal successors, (51), 51 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 51 transitions. [2022-02-20 16:20:43,191 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 51 transitions. Word has length 35 [2022-02-20 16:20:43,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:43,192 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 51 transitions. [2022-02-20 16:20:43,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,192 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2022-02-20 16:20:43,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 16:20:43,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:43,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:43,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:43,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:43,399 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:43,400 INFO L85 PathProgramCache]: Analyzing trace with hash -477653311, now seen corresponding path program 1 times [2022-02-20 16:20:43,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:43,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053754326] [2022-02-20 16:20:43,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:43,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:43,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:43,402 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:43,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 16:20:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:43,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:20:43,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:43,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:43,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {3122#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {3122#true} is VALID [2022-02-20 16:20:43,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {3122#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {3122#true} is VALID [2022-02-20 16:20:43,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {3122#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3122#true} is VALID [2022-02-20 16:20:43,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {3122#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {3122#true} is VALID [2022-02-20 16:20:43,554 INFO L290 TraceCheckUtils]: 4: Hoare triple {3122#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3122#true} is VALID [2022-02-20 16:20:43,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {3122#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3122#true} is VALID [2022-02-20 16:20:43,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {3122#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {3122#true} is VALID [2022-02-20 16:20:43,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {3122#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {3122#true} is VALID [2022-02-20 16:20:43,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {3122#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3122#true} is VALID [2022-02-20 16:20:43,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {3122#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3122#true} is VALID [2022-02-20 16:20:43,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {3122#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3122#true} is VALID [2022-02-20 16:20:43,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {3122#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3122#true} is VALID [2022-02-20 16:20:43,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {3122#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3122#true} is VALID [2022-02-20 16:20:43,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {3122#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3122#true} is VALID [2022-02-20 16:20:43,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {3122#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3122#true} is VALID [2022-02-20 16:20:43,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {3122#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3122#true} is VALID [2022-02-20 16:20:43,556 INFO L290 TraceCheckUtils]: 16: Hoare triple {3122#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3122#true} is VALID [2022-02-20 16:20:43,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {3122#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3122#true} is VALID [2022-02-20 16:20:43,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {3122#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {3122#true} is VALID [2022-02-20 16:20:43,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {3122#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {3122#true} is VALID [2022-02-20 16:20:43,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {3122#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3122#true} is VALID [2022-02-20 16:20:43,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {3122#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(main_~b~0#1, main_~b~0#1); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(main_~b~0#1, main_~b~0#1); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.leq~FLOAT(main_~b~0#1, main_~b~0#1); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.leq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:43,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {3190#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !~fp.geq~FLOAT(main_~b~0#1, main_~b~0#1); {3123#false} is VALID [2022-02-20 16:20:43,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {3123#false} assume !false; {3123#false} is VALID [2022-02-20 16:20:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:43,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:43,564 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:43,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053754326] [2022-02-20 16:20:43,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053754326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:43,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:43,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:43,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45531730] [2022-02-20 16:20:43,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:43,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-20 16:20:43,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:43,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:43,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:43,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:43,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:43,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:43,603 INFO L87 Difference]: Start difference. First operand 52 states and 51 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:43,682 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2022-02-20 16:20:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:43,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-02-20 16:20:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-20 16:20:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-02-20 16:20:43,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-02-20 16:20:43,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:43,746 INFO L225 Difference]: With dead ends: 52 [2022-02-20 16:20:43,746 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 16:20:43,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:43,747 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:43,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-02-20 16:20:43,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 16:20:43,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 16:20:43,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:43,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,749 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,750 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:43,750 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2022-02-20 16:20:43,750 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2022-02-20 16:20:43,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:43,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:43,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 0 states have call successors, (0), 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 50 states. [2022-02-20 16:20:43,752 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 0 states have call successors, (0), 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 50 states. [2022-02-20 16:20:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:43,753 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2022-02-20 16:20:43,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2022-02-20 16:20:43,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:43,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:43,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:43,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:43,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2022-02-20 16:20:43,755 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 36 [2022-02-20 16:20:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:43,756 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2022-02-20 16:20:43,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2022-02-20 16:20:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:20:43,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:43,757 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:43,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:43,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:43,966 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:43,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:43,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1922346431, now seen corresponding path program 1 times [2022-02-20 16:20:43,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:43,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62239581] [2022-02-20 16:20:43,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:43,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:43,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:43,969 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:43,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 16:20:43,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:43,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:20:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:44,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:44,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {3434#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {3434#true} is VALID [2022-02-20 16:20:44,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {3434#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {3434#true} is VALID [2022-02-20 16:20:44,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {3434#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3434#true} is VALID [2022-02-20 16:20:44,122 INFO L290 TraceCheckUtils]: 3: Hoare triple {3434#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {3434#true} is VALID [2022-02-20 16:20:44,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {3434#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3434#true} is VALID [2022-02-20 16:20:44,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {3434#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3434#true} is VALID [2022-02-20 16:20:44,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {3434#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {3434#true} is VALID [2022-02-20 16:20:44,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {3434#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {3434#true} is VALID [2022-02-20 16:20:44,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {3434#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3434#true} is VALID [2022-02-20 16:20:44,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {3434#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3434#true} is VALID [2022-02-20 16:20:44,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {3434#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3434#true} is VALID [2022-02-20 16:20:44,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {3434#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3434#true} is VALID [2022-02-20 16:20:44,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {3434#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3434#true} is VALID [2022-02-20 16:20:44,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {3434#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3434#true} is VALID [2022-02-20 16:20:44,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {3434#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3434#true} is VALID [2022-02-20 16:20:44,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {3434#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3434#true} is VALID [2022-02-20 16:20:44,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {3434#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3434#true} is VALID [2022-02-20 16:20:44,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {3434#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3434#true} is VALID [2022-02-20 16:20:44,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {3434#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {3434#true} is VALID [2022-02-20 16:20:44,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {3434#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {3434#true} is VALID [2022-02-20 16:20:44,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {3434#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3434#true} is VALID [2022-02-20 16:20:44,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {3434#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(main_~b~0#1, main_~b~0#1); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(main_~b~0#1, main_~b~0#1); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,129 INFO L290 TraceCheckUtils]: 32: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.leq~FLOAT(main_~b~0#1, main_~b~0#1); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.leq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !!~fp.geq~FLOAT(main_~b~0#1, main_~b~0#1); {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} is VALID [2022-02-20 16:20:44,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {3502#(exists ((currentRoundingMode RoundingMode)) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32))))} assume !~fp.geq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3435#false} is VALID [2022-02-20 16:20:44,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {3435#false} assume !false; {3435#false} is VALID [2022-02-20 16:20:44,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:44,131 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:44,131 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:44,132 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62239581] [2022-02-20 16:20:44,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62239581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:44,132 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:44,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:44,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847794221] [2022-02-20 16:20:44,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:44,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 16:20:44,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:44,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:44,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:44,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:44,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:44,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:44,177 INFO L87 Difference]: Start difference. First operand 50 states and 49 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:44,234 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2022-02-20 16:20:44,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:44,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 16:20:44,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-02-20 16:20:44,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2022-02-20 16:20:44,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2022-02-20 16:20:44,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:44,293 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:20:44,293 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 16:20:44,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:44,294 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:44,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-02-20 16:20:44,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 16:20:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 16:20:44,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:44,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,296 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,296 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:44,297 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2022-02-20 16:20:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2022-02-20 16:20:44,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:44,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:44,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 0 states have call successors, (0), 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 48 states. [2022-02-20 16:20:44,297 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 0 states have call successors, (0), 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 48 states. [2022-02-20 16:20:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:44,298 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2022-02-20 16:20:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2022-02-20 16:20:44,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:44,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:44,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:44,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2022-02-20 16:20:44,300 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 37 [2022-02-20 16:20:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:44,300 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2022-02-20 16:20:44,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2022-02-20 16:20:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 16:20:44,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:44,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:44,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:44,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:44,510 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:44,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:44,510 INFO L85 PathProgramCache]: Analyzing trace with hash 536807113, now seen corresponding path program 1 times [2022-02-20 16:20:44,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:44,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792822757] [2022-02-20 16:20:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:44,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:44,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:44,512 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:44,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 16:20:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:44,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:20:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:44,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:44,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {3741#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {3741#true} is VALID [2022-02-20 16:20:44,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {3741#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {3741#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {3741#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 4: Hoare triple {3741#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {3741#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {3741#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {3741#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {3741#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {3741#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {3741#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3741#true} is VALID [2022-02-20 16:20:44,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {3741#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3741#true} is VALID [2022-02-20 16:20:44,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {3741#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3741#true} is VALID [2022-02-20 16:20:44,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {3741#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3741#true} is VALID [2022-02-20 16:20:44,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {3741#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3741#true} is VALID [2022-02-20 16:20:44,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {3741#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3741#true} is VALID [2022-02-20 16:20:44,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {3741#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {3741#true} is VALID [2022-02-20 16:20:44,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {3741#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {3741#true} is VALID [2022-02-20 16:20:44,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {3741#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {3741#true} is VALID [2022-02-20 16:20:44,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {3741#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {3741#true} is VALID [2022-02-20 16:20:44,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {3741#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {3741#true} is VALID [2022-02-20 16:20:44,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {3741#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(main_~b~0#1, main_~b~0#1); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,779 INFO L290 TraceCheckUtils]: 29: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(main_~b~0#1, main_~b~0#1); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,782 INFO L290 TraceCheckUtils]: 31: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,784 INFO L290 TraceCheckUtils]: 32: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(main_~b~0#1, main_~b~0#1); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(main_~b~0#1, main_~b~0#1); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:44,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {3809#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !~fp.leq~FLOAT(main_~a~0#1, main_~b~0#1); {3742#false} is VALID [2022-02-20 16:20:44,790 INFO L290 TraceCheckUtils]: 37: Hoare triple {3742#false} assume !false; {3742#false} is VALID [2022-02-20 16:20:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:44,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:44,791 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:44,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792822757] [2022-02-20 16:20:44,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792822757] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:44,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:44,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:44,791 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611632418] [2022-02-20 16:20:44,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:44,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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) Word has length 38 [2022-02-20 16:20:44,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:44,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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) [2022-02-20 16:20:44,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:44,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:44,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:44,839 INFO L87 Difference]: Start difference. First operand 48 states and 47 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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) [2022-02-20 16:20:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:44,904 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2022-02-20 16:20:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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) Word has length 38 [2022-02-20 16:20:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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) [2022-02-20 16:20:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 16:20:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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) [2022-02-20 16:20:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-02-20 16:20:44,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-02-20 16:20:44,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:44,967 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:20:44,967 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:20:44,968 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:44,968 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:44,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-02-20 16:20:44,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:20:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 16:20:44,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:44,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,973 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,980 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:44,980 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2022-02-20 16:20:44,980 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2022-02-20 16:20:44,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:44,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:44,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 states. [2022-02-20 16:20:44,981 INFO L87 Difference]: Start difference. First operand has 46 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 0 states have call successors, (0), 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 46 states. [2022-02-20 16:20:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:44,982 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2022-02-20 16:20:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2022-02-20 16:20:44,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:44,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:44,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:44,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2022-02-20 16:20:44,983 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 38 [2022-02-20 16:20:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:44,983 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2022-02-20 16:20:44,983 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 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) [2022-02-20 16:20:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2022-02-20 16:20:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 16:20:44,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:44,987 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:44,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:45,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:45,191 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash -538844343, now seen corresponding path program 1 times [2022-02-20 16:20:45,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:45,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824089339] [2022-02-20 16:20:45,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:45,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:45,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:45,194 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:45,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 16:20:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:45,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:20:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:45,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:45,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {4043#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {4043#true} is VALID [2022-02-20 16:20:45,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {4043#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {4043#true} is VALID [2022-02-20 16:20:45,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {4043#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4043#true} is VALID [2022-02-20 16:20:45,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {4043#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {4043#true} is VALID [2022-02-20 16:20:45,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {4043#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {4043#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {4043#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {4043#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {4043#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {4043#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {4043#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {4043#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {4043#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {4043#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4043#true} is VALID [2022-02-20 16:20:45,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {4043#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4043#true} is VALID [2022-02-20 16:20:45,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {4043#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4043#true} is VALID [2022-02-20 16:20:45,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {4043#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4043#true} is VALID [2022-02-20 16:20:45,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {4043#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4043#true} is VALID [2022-02-20 16:20:45,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {4043#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {4043#true} is VALID [2022-02-20 16:20:45,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {4043#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {4043#true} is VALID [2022-02-20 16:20:45,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {4043#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {4043#true} is VALID [2022-02-20 16:20:45,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {4043#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,465 INFO L290 TraceCheckUtils]: 26: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(main_~b~0#1, main_~b~0#1); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(main_~b~0#1, main_~b~0#1); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(main_~b~0#1, main_~b~0#1); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(main_~b~0#1, main_~b~0#1); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(main_~a~0#1, main_~b~0#1); {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:45,497 INFO L290 TraceCheckUtils]: 37: Hoare triple {4111#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4044#false} is VALID [2022-02-20 16:20:45,497 INFO L290 TraceCheckUtils]: 38: Hoare triple {4044#false} assume !false; {4044#false} is VALID [2022-02-20 16:20:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:45,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:45,498 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:45,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824089339] [2022-02-20 16:20:45,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824089339] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:45,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:45,498 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:45,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578236032] [2022-02-20 16:20:45,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:45,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 16:20:45,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:45,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:45,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:45,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:45,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:45,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:45,561 INFO L87 Difference]: Start difference. First operand 46 states and 45 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:45,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:45,629 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2022-02-20 16:20:45,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:45,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-02-20 16:20:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 16:20:45,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:45,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-02-20 16:20:45,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2022-02-20 16:20:45,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:45,699 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:20:45,699 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:20:45,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:45,700 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:45,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-02-20 16:20:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:20:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 16:20:45,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:45,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 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) [2022-02-20 16:20:45,702 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 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) [2022-02-20 16:20:45,702 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 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) [2022-02-20 16:20:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:45,703 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2022-02-20 16:20:45,703 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2022-02-20 16:20:45,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:45,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:45,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 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) Second operand 44 states. [2022-02-20 16:20:45,703 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 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) Second operand 44 states. [2022-02-20 16:20:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:45,704 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2022-02-20 16:20:45,705 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2022-02-20 16:20:45,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:45,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:45,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:45,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 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) [2022-02-20 16:20:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2022-02-20 16:20:45,706 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 39 [2022-02-20 16:20:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:45,706 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2022-02-20 16:20:45,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:45,707 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2022-02-20 16:20:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 16:20:45,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:45,707 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:45,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:45,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:45,917 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:45,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 475698897, now seen corresponding path program 1 times [2022-02-20 16:20:45,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:45,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805644611] [2022-02-20 16:20:45,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:45,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:45,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:45,919 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:45,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 16:20:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:45,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:20:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:45,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:46,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {4340#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {4340#true} is VALID [2022-02-20 16:20:46,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {4340#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {4340#true} is VALID [2022-02-20 16:20:46,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {4340#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4340#true} is VALID [2022-02-20 16:20:46,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {4340#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {4340#true} is VALID [2022-02-20 16:20:46,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {4340#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4340#true} is VALID [2022-02-20 16:20:46,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {4340#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4340#true} is VALID [2022-02-20 16:20:46,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {4340#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {4340#true} is VALID [2022-02-20 16:20:46,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {4340#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {4340#true} is VALID [2022-02-20 16:20:46,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {4340#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4340#true} is VALID [2022-02-20 16:20:46,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {4340#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {4340#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {4340#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {4340#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {4340#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {4340#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {4340#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {4340#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {4340#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {4340#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {4340#true} is VALID [2022-02-20 16:20:46,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {4340#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {4340#true} is VALID [2022-02-20 16:20:46,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {4340#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {4340#true} is VALID [2022-02-20 16:20:46,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {4340#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(main_~b~0#1, main_~b~0#1); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(main_~b~0#1, main_~b~0#1); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,229 INFO L290 TraceCheckUtils]: 32: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(main_~b~0#1, main_~b~0#1); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(main_~b~0#1, main_~b~0#1); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(main_~a~0#1, main_~b~0#1); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.leq~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,239 INFO L290 TraceCheckUtils]: 38: Hoare triple {4408#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !~fp.geq~FLOAT(main_~b~0#1, main_~a~0#1); {4341#false} is VALID [2022-02-20 16:20:46,239 INFO L290 TraceCheckUtils]: 39: Hoare triple {4341#false} assume !false; {4341#false} is VALID [2022-02-20 16:20:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:46,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:46,240 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:46,240 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805644611] [2022-02-20 16:20:46,240 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805644611] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:46,240 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:46,240 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:46,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18982476] [2022-02-20 16:20:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:46,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 16:20:46,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:46,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:46,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:46,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:46,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:46,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:46,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:46,311 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:46,369 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2022-02-20 16:20:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:46,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-02-20 16:20:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-02-20 16:20:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-02-20 16:20:46,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2022-02-20 16:20:46,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:46,449 INFO L225 Difference]: With dead ends: 44 [2022-02-20 16:20:46,449 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 16:20:46,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:46,450 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:46,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-02-20 16:20:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 16:20:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-20 16:20:46,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:46,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.0) internal successors, (41), 41 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) [2022-02-20 16:20:46,452 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.0) internal successors, (41), 41 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) [2022-02-20 16:20:46,452 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 41 states have (on average 1.0) internal successors, (41), 41 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) [2022-02-20 16:20:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:46,453 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2022-02-20 16:20:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2022-02-20 16:20:46,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:46,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:46,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.0) internal successors, (41), 41 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) Second operand 42 states. [2022-02-20 16:20:46,454 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.0) internal successors, (41), 41 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) Second operand 42 states. [2022-02-20 16:20:46,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:46,454 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2022-02-20 16:20:46,455 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2022-02-20 16:20:46,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:46,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:46,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:46,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0) internal successors, (41), 41 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) [2022-02-20 16:20:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2022-02-20 16:20:46,456 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 40 [2022-02-20 16:20:46,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:46,456 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2022-02-20 16:20:46,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:46,457 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2022-02-20 16:20:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 16:20:46,457 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:20:46,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:46,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:46,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:46,670 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-02-20 16:20:46,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:20:46,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1861768273, now seen corresponding path program 1 times [2022-02-20 16:20:46,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:20:46,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217163880] [2022-02-20 16:20:46,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:20:46,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:20:46,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:20:46,672 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:20:46,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 16:20:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:46,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:20:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:20:46,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:20:46,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {4632#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {4632#true} is VALID [2022-02-20 16:20:46,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {4632#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~a~0#1, main_~b~0#1; {4632#true} is VALID [2022-02-20 16:20:46,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {4632#true} assume !!!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4632#true} is VALID [2022-02-20 16:20:46,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {4632#true} assume !!~fp.eq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {4632#true} is VALID [2022-02-20 16:20:46,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {4632#true} assume !!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {4632#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {4632#true} assume !!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {4632#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {4632#true} assume !!!~fp.lt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {4632#true} assume !!!~fp.lt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {4632#true} assume !!!~fp.gt~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {4632#true} assume !!!~fp.gt~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {4632#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {4632#true} assume !!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {4632#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {4632#true} assume !!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {4632#true} assume !!~fp.leq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0), ~to_fp~DOUBLE(currentRoundingMode, 2.0)); {4632#true} is VALID [2022-02-20 16:20:46,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {4632#true} assume !!!~fp.leq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0))); {4632#true} is VALID [2022-02-20 16:20:46,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {4632#true} assume !!~fp.geq~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0), ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {4632#true} is VALID [2022-02-20 16:20:46,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {4632#true} assume !!!~fp.geq~DOUBLE(~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 2.0)), ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {4632#true} is VALID [2022-02-20 16:20:46,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {4632#true} main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {4632#true} is VALID [2022-02-20 16:20:46,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {4632#true} assume !!(~fp.eq~FLOAT(main_~a~0#1, ~convertINTToFLOAT(currentRoundingMode, 1bv32)) && ~fp.eq~FLOAT(main_~b~0#1, ~convertINTToFLOAT(currentRoundingMode, 2bv32))); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.eq~FLOAT(main_~a~0#1, main_~b~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.eq~FLOAT(main_~a~0#1, main_~a~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.lt~FLOAT(main_~a~0#1, main_~b~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.gt~FLOAT(main_~b~0#1, main_~a~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,962 INFO L290 TraceCheckUtils]: 27: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(main_~b~0#1, main_~b~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.lt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(main_~b~0#1, main_~b~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.gt~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(main_~b~0#1, main_~b~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(main_~b~0#1, main_~b~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,980 INFO L290 TraceCheckUtils]: 35: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.leq~FLOAT(main_~a~0#1, main_~b~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,985 INFO L290 TraceCheckUtils]: 37: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!!~fp.leq~FLOAT(~fp.neg~FLOAT(main_~a~0#1), ~fp.neg~FLOAT(main_~b~0#1)); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(main_~b~0#1, main_~a~0#1); {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} is VALID [2022-02-20 16:20:46,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {4700#(exists ((currentRoundingMode RoundingMode)) (and (fp.eq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv1 32))) (fp.eq |ULTIMATE.start_main_~b~0#1| ((_ to_fp 8 24) currentRoundingMode (_ bv2 32)))))} assume !!~fp.geq~FLOAT(~fp.neg~FLOAT(main_~b~0#1), ~fp.neg~FLOAT(main_~a~0#1)); {4633#false} is VALID [2022-02-20 16:20:46,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {4633#false} assume !false; {4633#false} is VALID [2022-02-20 16:20:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:20:46,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:20:46,991 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:20:46,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217163880] [2022-02-20 16:20:46,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217163880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:20:46,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:20:46,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:20:46,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344827047] [2022-02-20 16:20:46,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:20:46,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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 41 [2022-02-20 16:20:46,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:20:46,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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) [2022-02-20 16:20:47,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:47,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:20:47,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:20:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:20:47,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:47,056 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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) [2022-02-20 16:20:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:47,102 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2022-02-20 16:20:47,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:20:47,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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 41 [2022-02-20 16:20:47,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:20:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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) [2022-02-20 16:20:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-20 16:20:47,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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) [2022-02-20 16:20:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-02-20 16:20:47,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 41 transitions. [2022-02-20 16:20:47,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:20:47,158 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:20:47,158 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:20:47,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:20:47,159 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:20:47,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-02-20 16:20:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:20:47,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:20:47,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:20:47,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:47,160 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:47,160 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:47,161 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:20:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:20:47,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:47,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:47,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:20:47,161 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:20:47,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:20:47,162 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:20:47,162 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:20:47,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:47,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:20:47,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:20:47,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:20:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:20:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:20:47,163 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-02-20 16:20:47,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:20:47,163 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:20:47,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 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) [2022-02-20 16:20:47,163 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:20:47,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:20:47,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (35 of 36 remaining) [2022-02-20 16:20:47,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (34 of 36 remaining) [2022-02-20 16:20:47,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (33 of 36 remaining) [2022-02-20 16:20:47,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (32 of 36 remaining) [2022-02-20 16:20:47,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (31 of 36 remaining) [2022-02-20 16:20:47,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (30 of 36 remaining) [2022-02-20 16:20:47,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (29 of 36 remaining) [2022-02-20 16:20:47,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (28 of 36 remaining) [2022-02-20 16:20:47,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (27 of 36 remaining) [2022-02-20 16:20:47,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (26 of 36 remaining) [2022-02-20 16:20:47,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (25 of 36 remaining) [2022-02-20 16:20:47,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (24 of 36 remaining) [2022-02-20 16:20:47,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (23 of 36 remaining) [2022-02-20 16:20:47,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (22 of 36 remaining) [2022-02-20 16:20:47,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (21 of 36 remaining) [2022-02-20 16:20:47,168 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (20 of 36 remaining) [2022-02-20 16:20:47,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (19 of 36 remaining) [2022-02-20 16:20:47,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (18 of 36 remaining) [2022-02-20 16:20:47,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (17 of 36 remaining) [2022-02-20 16:20:47,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (16 of 36 remaining) [2022-02-20 16:20:47,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (15 of 36 remaining) [2022-02-20 16:20:47,169 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (14 of 36 remaining) [2022-02-20 16:20:47,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (13 of 36 remaining) [2022-02-20 16:20:47,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (12 of 36 remaining) [2022-02-20 16:20:47,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (11 of 36 remaining) [2022-02-20 16:20:47,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (10 of 36 remaining) [2022-02-20 16:20:47,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (9 of 36 remaining) [2022-02-20 16:20:47,170 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (8 of 36 remaining) [2022-02-20 16:20:47,171 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (7 of 36 remaining) [2022-02-20 16:20:47,171 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (6 of 36 remaining) [2022-02-20 16:20:47,171 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (5 of 36 remaining) [2022-02-20 16:20:47,171 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (4 of 36 remaining) [2022-02-20 16:20:47,171 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (3 of 36 remaining) [2022-02-20 16:20:47,171 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (2 of 36 remaining) [2022-02-20 16:20:47,172 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (1 of 36 remaining) [2022-02-20 16:20:47,172 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (0 of 36 remaining) [2022-02-20 16:20:47,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 16:20:47,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:20:47,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:20:47,385 INFO L858 garLoopResultBuilder]: For program point L35-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,385 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2022-02-20 16:20:47,385 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-02-20 16:20:47,385 INFO L858 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-02-20 16:20:47,385 INFO L858 garLoopResultBuilder]: For program point L19-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L36-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L20-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L37-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L21-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point L38-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,386 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-02-20 16:20:47,387 INFO L858 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-02-20 16:20:47,387 INFO L858 garLoopResultBuilder]: For program point L22-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,387 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 26) no Hoare annotation was computed. [2022-02-20 16:20:47,387 INFO L858 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-02-20 16:20:47,387 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2022-02-20 16:20:47,387 INFO L858 garLoopResultBuilder]: For program point L6(lines 6 50) no Hoare annotation was computed. [2022-02-20 16:20:47,387 INFO L858 garLoopResultBuilder]: For program point L39-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,387 INFO L858 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-02-20 16:20:47,388 INFO L858 garLoopResultBuilder]: For program point L23-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,388 INFO L858 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-02-20 16:20:47,388 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,388 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 38) no Hoare annotation was computed. [2022-02-20 16:20:47,388 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-02-20 16:20:47,388 INFO L858 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-02-20 16:20:47,388 INFO L858 garLoopResultBuilder]: For program point L24-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,389 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 33) no Hoare annotation was computed. [2022-02-20 16:20:47,389 INFO L858 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-02-20 16:20:47,389 INFO L858 garLoopResultBuilder]: For program point L41-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,389 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 49) no Hoare annotation was computed. [2022-02-20 16:20:47,389 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:20:47,389 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-02-20 16:20:47,389 INFO L858 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-02-20 16:20:47,389 INFO L858 garLoopResultBuilder]: For program point L25-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 32) no Hoare annotation was computed. [2022-02-20 16:20:47,390 INFO L858 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-02-20 16:20:47,390 INFO L858 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-02-20 16:20:47,390 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-02-20 16:20:47,390 INFO L858 garLoopResultBuilder]: For program point L9-1(line 9) no Hoare annotation was computed. [2022-02-20 16:20:47,390 INFO L858 garLoopResultBuilder]: For program point L42-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,390 INFO L858 garLoopResultBuilder]: For program point L9-3(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,391 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2022-02-20 16:20:47,391 INFO L858 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-02-20 16:20:47,391 INFO L858 garLoopResultBuilder]: For program point L26-2(line 26) no Hoare annotation was computed. [2022-02-20 16:20:47,391 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2022-02-20 16:20:47,391 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 22) no Hoare annotation was computed. [2022-02-20 16:20:47,391 INFO L858 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-02-20 16:20:47,391 INFO L858 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-02-20 16:20:47,391 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,392 INFO L858 garLoopResultBuilder]: For program point L10-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,392 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-02-20 16:20:47,392 INFO L858 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-02-20 16:20:47,392 INFO L858 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-02-20 16:20:47,392 INFO L858 garLoopResultBuilder]: For program point L44-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,392 INFO L858 garLoopResultBuilder]: For program point L11-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,392 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2022-02-20 16:20:47,392 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-02-20 16:20:47,393 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:20:47,393 INFO L858 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-02-20 16:20:47,393 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-02-20 16:20:47,393 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 24) no Hoare annotation was computed. [2022-02-20 16:20:47,393 INFO L858 garLoopResultBuilder]: For program point L45-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,393 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,393 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2022-02-20 16:20:47,394 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2022-02-20 16:20:47,394 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-02-20 16:20:47,394 INFO L858 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-02-20 16:20:47,394 INFO L858 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-02-20 16:20:47,394 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2022-02-20 16:20:47,394 INFO L858 garLoopResultBuilder]: For program point L46-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,394 INFO L858 garLoopResultBuilder]: For program point L13-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,394 INFO L858 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-02-20 16:20:47,395 INFO L858 garLoopResultBuilder]: For program point L30-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,395 INFO L858 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-02-20 16:20:47,395 INFO L858 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-02-20 16:20:47,395 INFO L858 garLoopResultBuilder]: For program point L47-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,395 INFO L858 garLoopResultBuilder]: For program point L14-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,395 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2022-02-20 16:20:47,395 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-02-20 16:20:47,396 INFO L858 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-02-20 16:20:47,396 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-02-20 16:20:47,396 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2022-02-20 16:20:47,396 INFO L858 garLoopResultBuilder]: For program point L48-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,396 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,396 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2022-02-20 16:20:47,396 INFO L858 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-02-20 16:20:47,396 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:20:47,397 INFO L858 garLoopResultBuilder]: For program point L32-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,397 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2022-02-20 16:20:47,397 INFO L858 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-02-20 16:20:47,397 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-02-20 16:20:47,397 INFO L858 garLoopResultBuilder]: For program point L16-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,397 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2022-02-20 16:20:47,397 INFO L858 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-02-20 16:20:47,397 INFO L858 garLoopResultBuilder]: For program point L33-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,398 INFO L858 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-02-20 16:20:47,398 INFO L858 garLoopResultBuilder]: For program point L17-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,398 INFO L858 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-02-20 16:20:47,398 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 40) no Hoare annotation was computed. [2022-02-20 16:20:47,398 INFO L858 garLoopResultBuilder]: For program point L34-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,398 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-02-20 16:20:47,398 INFO L858 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2022-02-20 16:20:47,399 INFO L858 garLoopResultBuilder]: For program point L18-2(lines 7 50) no Hoare annotation was computed. [2022-02-20 16:20:47,399 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2022-02-20 16:20:47,399 INFO L858 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-02-20 16:20:47,402 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:20:47,404 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:20:47,407 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:20:47,407 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:20:47,407 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 16:20:47,407 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-02-20 16:20:47,407 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2022-02-20 16:20:47,407 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-02-20 16:20:47,408 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-02-20 16:20:47,409 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 16:20:47,409 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 16:20:47,409 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 16:20:47,409 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 16:20:47,409 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 16:20:47,409 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 16:20:47,409 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-02-20 16:20:47,409 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-02-20 16:20:47,409 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 16:20:47,410 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 16:20:47,410 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-20 16:20:47,410 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2022-02-20 16:20:47,410 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:20:47,410 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:20:47,410 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 16:20:47,410 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 16:20:47,410 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 16:20:47,410 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 16:20:47,411 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:20:47,411 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 16:20:47,411 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 16:20:47,411 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 16:20:47,411 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-20 16:20:47,411 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2022-02-20 16:20:47,411 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:20:47,411 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:20:47,411 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-20 16:20:47,412 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:20:47,413 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2022-02-20 16:20:47,413 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:20:47,413 WARN L170 areAnnotationChecker]: L21-2 has no Hoare annotation [2022-02-20 16:20:47,413 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 16:20:47,413 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 16:20:47,413 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:20:47,413 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:20:47,413 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:20:47,413 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-02-20 16:20:47,414 WARN L170 areAnnotationChecker]: L25-2 has no Hoare annotation [2022-02-20 16:20:47,415 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:20:47,415 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 16:20:47,415 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 16:20:47,415 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:20:47,415 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:20:47,415 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-02-20 16:20:47,415 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-02-20 16:20:47,415 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:20:47,415 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-02-20 16:20:47,416 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L36-2 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:20:47,417 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-02-20 16:20:47,418 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:20:47,418 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:20:47,418 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:20:47,418 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:20:47,418 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:20:47,418 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:20:47,418 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:20:47,418 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:20:47,418 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:20:47,419 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 16:20:47,419 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:20:47,419 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:20:47,419 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:20:47,419 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:20:47,419 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:20:47,419 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:20:47,419 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:20:47,419 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:20:47,420 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:20:47,420 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:20:47,420 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 16:20:47,420 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 16:20:47,420 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:20:47,420 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:20:47,420 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:20:47,420 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:20:47,420 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L44-2 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L45-2 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:20:47,421 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:20:47,422 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:20:47,422 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:20:47,422 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:20:47,422 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 16:20:47,422 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 16:20:47,422 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:20:47,422 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:20:47,422 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:20:47,422 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 16:20:47,423 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:20:47,423 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:20:47,423 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 16:20:47,423 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:20:47,423 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:20:47,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:20:47 BoogieIcfgContainer [2022-02-20 16:20:47,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:20:47,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:20:47,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:20:47,426 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:20:47,427 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:20:37" (3/4) ... [2022-02-20 16:20:47,429 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:20:47,441 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 16:20:47,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:20:47,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:20:47,442 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:20:47,486 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:20:47,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:20:47,487 INFO L158 Benchmark]: Toolchain (without parser) took 10792.38ms. Allocated memory was 58.7MB in the beginning and 86.0MB in the end (delta: 27.3MB). Free memory was 37.5MB in the beginning and 65.9MB in the end (delta: -28.4MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2022-02-20 16:20:47,487 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 58.7MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:20:47,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.23ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 38.6MB in the end (delta: -1.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:20:47,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.58ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 36.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:20:47,488 INFO L158 Benchmark]: Boogie Preprocessor took 43.38ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 34.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:20:47,488 INFO L158 Benchmark]: RCFGBuilder took 359.00ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.6MB in the beginning and 48.8MB in the end (delta: -14.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:20:47,489 INFO L158 Benchmark]: TraceAbstraction took 9909.65ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 48.2MB in the beginning and 30.1MB in the end (delta: 18.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2022-02-20 16:20:47,489 INFO L158 Benchmark]: Witness Printer took 61.33ms. Allocated memory is still 86.0MB. Free memory was 30.1MB in the beginning and 65.9MB in the end (delta: -35.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:20:47,490 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 58.7MB. Free memory is still 40.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.23ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 38.6MB in the end (delta: -1.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.58ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 36.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.38ms. Allocated memory is still 58.7MB. Free memory was 36.4MB in the beginning and 34.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 359.00ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.6MB in the beginning and 48.8MB in the end (delta: -14.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9909.65ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 48.2MB in the beginning and 30.1MB in the end (delta: 18.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Witness Printer took 61.33ms. Allocated memory is still 86.0MB. Free memory was 30.1MB in the beginning and 65.9MB in the end (delta: -35.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 9]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 22]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 23]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 24]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 25]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 26]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 32]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 33]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 34]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 35]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 37]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 38]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 39]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 40]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 41]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 42]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 43]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 45]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 46]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 49]: 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, 115 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1035 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 341 IncrementalHoareTripleChecker+Unchecked, 369 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 666 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 448 ConstructedInterpolants, 137 QuantifiedInterpolants, 1643 SizeOfPredicates, 37 NumberOfNonLiveVariables, 701 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 16:20:47,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE