./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 08:14:23,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:14:23,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:14:23,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:14:23,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:14:23,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:14:23,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:14:23,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:14:23,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:14:23,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:14:23,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:14:23,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:14:23,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:14:23,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:14:23,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:14:23,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:14:23,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:14:23,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:14:23,404 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:14:23,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:14:23,411 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:14:23,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:14:23,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:14:23,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:14:23,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:14:23,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:14:23,429 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:14:23,430 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:14:23,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:14:23,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:14:23,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:14:23,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:14:23,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:14:23,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:14:23,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:14:23,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:14:23,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:14:23,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:14:23,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:14:23,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:14:23,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:14:23,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 08:14:23,469 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:14:23,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:14:23,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:14:23,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:14:23,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:14:23,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:14:23,471 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:14:23,471 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:14:23,471 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:14:23,471 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:14:23,471 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:14:23,472 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:14:23,472 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:14:23,472 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:14:23,472 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:14:23,472 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:14:23,473 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:14:23,473 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:14:23,474 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:14:23,474 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:14:23,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:14:23,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:14:23,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:14:23,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:14:23,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:14:23,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:14:23,475 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:14:23,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:14:23,476 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:14:23,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:14:23,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:14:23,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:14:23,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:14:23,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:14:23,477 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:14:23,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:14:23,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:14:23,478 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:14:23,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:14:23,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:14:23,479 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:14:23,479 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS 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 -> Taipan 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2022-11-19 08:14:23,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:14:23,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:14:23,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:14:23,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:14:23,806 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:14:23,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-11-19 08:14:23,868 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data/3427f0d90/b1f2b6fc108941489d2b20bcacc138d7/FLAG3af74f4b6 [2022-11-19 08:14:24,384 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:14:24,385 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-11-19 08:14:24,391 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data/3427f0d90/b1f2b6fc108941489d2b20bcacc138d7/FLAG3af74f4b6 [2022-11-19 08:14:24,781 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data/3427f0d90/b1f2b6fc108941489d2b20bcacc138d7 [2022-11-19 08:14:24,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:14:24,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:14:24,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:14:24,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:14:24,793 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:14:24,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:14:24" (1/1) ... [2022-11-19 08:14:24,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ea4431 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:24, skipping insertion in model container [2022-11-19 08:14:24,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:14:24" (1/1) ... [2022-11-19 08:14:24,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:14:24,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:14:24,981 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-11-19 08:14:24,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:14:25,003 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:14:25,020 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-11-19 08:14:25,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:14:25,034 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:14:25,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25 WrapperNode [2022-11-19 08:14:25,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:14:25,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:14:25,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:14:25,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:14:25,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,066 INFO L138 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-11-19 08:14:25,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:14:25,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:14:25,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:14:25,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:14:25,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,085 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:14:25,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:14:25,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:14:25,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:14:25,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (1/1) ... [2022-11-19 08:14:25,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:14:25,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:25,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:14:25,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:14:25,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:14:25,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:14:25,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:14:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:14:25,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 08:14:25,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 08:14:25,253 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:14:25,255 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:14:25,416 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:14:25,435 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:14:25,435 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 08:14:25,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:14:25 BoogieIcfgContainer [2022-11-19 08:14:25,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:14:25,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:14:25,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:14:25,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:14:25,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:14:24" (1/3) ... [2022-11-19 08:14:25,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f61b9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:14:25, skipping insertion in model container [2022-11-19 08:14:25,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:25" (2/3) ... [2022-11-19 08:14:25,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f61b9fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:14:25, skipping insertion in model container [2022-11-19 08:14:25,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:14:25" (3/3) ... [2022-11-19 08:14:25,446 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-11-19 08:14:25,464 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:14:25,464 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 08:14:25,514 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:14:25,521 INFO L357 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@181c3ad1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:14:25,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 08:14:25,525 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 08:14:25,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:14:25,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:25,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:14:25,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:14:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:25,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2071569913, now seen corresponding path program 1 times [2022-11-19 08:14:25,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:14:25,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470323515] [2022-11-19 08:14:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:25,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:14:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:14:25,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:14:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:14:25,687 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 08:14:25,689 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:14:25,691 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-19 08:14:25,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:14:25,698 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-19 08:14:25,703 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:14:25,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:14:25 BoogieIcfgContainer [2022-11-19 08:14:25,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:14:25,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:14:25,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:14:25,723 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:14:25,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:14:25" (3/4) ... [2022-11-19 08:14:25,727 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 08:14:25,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:14:25,729 INFO L158 Benchmark]: Toolchain (without parser) took 943.79ms. Allocated memory is still 130.0MB. Free memory was 98.9MB in the beginning and 78.8MB in the end (delta: 20.1MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-11-19 08:14:25,729 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 94.4MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:14:25,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.95ms. Allocated memory is still 130.0MB. Free memory was 98.9MB in the beginning and 106.0MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 08:14:25,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.08ms. Allocated memory is still 130.0MB. Free memory was 106.0MB in the beginning and 104.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:14:25,731 INFO L158 Benchmark]: Boogie Preprocessor took 20.81ms. Allocated memory is still 130.0MB. Free memory was 104.4MB in the beginning and 103.6MB in the end (delta: 793.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:14:25,732 INFO L158 Benchmark]: RCFGBuilder took 349.53ms. Allocated memory is still 130.0MB. Free memory was 103.2MB in the beginning and 93.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 08:14:25,733 INFO L158 Benchmark]: TraceAbstraction took 282.84ms. Allocated memory is still 130.0MB. Free memory was 92.7MB in the beginning and 79.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 08:14:25,733 INFO L158 Benchmark]: Witness Printer took 4.97ms. Allocated memory is still 130.0MB. Free memory was 79.2MB in the beginning and 78.8MB in the end (delta: 436.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:14:25,736 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 94.4MB. Free memory was 51.5MB in the beginning and 51.5MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.95ms. Allocated memory is still 130.0MB. Free memory was 98.9MB in the beginning and 106.0MB in the end (delta: -7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.08ms. Allocated memory is still 130.0MB. Free memory was 106.0MB in the beginning and 104.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.81ms. Allocated memory is still 130.0MB. Free memory was 104.4MB in the beginning and 103.6MB in the end (delta: 793.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 349.53ms. Allocated memory is still 130.0MB. Free memory was 103.2MB in the beginning and 93.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 282.84ms. Allocated memory is still 130.0MB. Free memory was 92.7MB in the beginning and 79.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.97ms. Allocated memory is still 130.0MB. Free memory was 79.2MB in the beginning and 78.8MB in the end (delta: 436.1kB). 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: 10]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x=12, x1=12, y=16, y1=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L10] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 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, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred 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, 6 NumberOfCodeBlocks, 6 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-11-19 08:14:25,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 08:14:28,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:14:28,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:14:28,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:14:28,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:14:28,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:14:28,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:14:28,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:14:28,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:14:28,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:14:28,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:14:28,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:14:28,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:14:28,104 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:14:28,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:14:28,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:14:28,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:14:28,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:14:28,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:14:28,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:14:28,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:14:28,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:14:28,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:14:28,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:14:28,142 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:14:28,142 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:14:28,142 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:14:28,143 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:14:28,144 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:14:28,145 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:14:28,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:14:28,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:14:28,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:14:28,147 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:14:28,148 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:14:28,149 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:14:28,149 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:14:28,150 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:14:28,150 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:14:28,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:14:28,152 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:14:28,161 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-19 08:14:28,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:14:28,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:14:28,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:14:28,202 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:14:28,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:14:28,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:14:28,203 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:14:28,203 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:14:28,203 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:14:28,204 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:14:28,205 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:14:28,205 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:14:28,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:14:28,206 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:14:28,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:14:28,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:14:28,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:14:28,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:14:28,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:14:28,207 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:14:28,208 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 08:14:28,208 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 08:14:28,208 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:14:28,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:14:28,208 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:14:28,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:14:28,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:14:28,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 08:14:28,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:14:28,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:14:28,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:14:28,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:14:28,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:14:28,210 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 08:14:28,210 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 08:14:28,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:14:28,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:14:28,211 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 08:14:28,211 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS 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 -> Taipan 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 -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2022-11-19 08:14:28,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:14:28,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:14:28,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:14:28,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:14:28,596 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:14:28,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2022-11-19 08:14:28,672 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data/e60690681/c5aa0c83819b422eb08399d6aeb3f163/FLAG288a20e22 [2022-11-19 08:14:29,077 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:14:29,078 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/sv-benchmarks/c/float-benchs/zonotope_2.c [2022-11-19 08:14:29,084 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data/e60690681/c5aa0c83819b422eb08399d6aeb3f163/FLAG288a20e22 [2022-11-19 08:14:29,467 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/data/e60690681/c5aa0c83819b422eb08399d6aeb3f163 [2022-11-19 08:14:29,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:14:29,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:14:29,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:14:29,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:14:29,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:14:29,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38780349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29, skipping insertion in model container [2022-11-19 08:14:29,480 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:14:29,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:14:29,638 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-11-19 08:14:29,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:14:29,664 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:14:29,680 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2022-11-19 08:14:29,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:14:29,698 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:14:29,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29 WrapperNode [2022-11-19 08:14:29,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:14:29,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:14:29,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:14:29,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:14:29,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,731 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2022-11-19 08:14:29,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:14:29,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:14:29,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:14:29,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:14:29,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,770 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:14:29,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:14:29,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:14:29,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:14:29,776 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (1/1) ... [2022-11-19 08:14:29,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:14:29,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:14:29,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:14:29,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:14:29,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:14:29,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:14:29,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:14:29,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 08:14:29,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 08:14:29,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 08:14:29,925 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:14:29,928 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:14:32,117 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:14:32,123 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:14:32,123 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 08:14:32,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:14:32 BoogieIcfgContainer [2022-11-19 08:14:32,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:14:32,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:14:32,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:14:32,138 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:14:32,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:14:29" (1/3) ... [2022-11-19 08:14:32,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1931dee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:14:32, skipping insertion in model container [2022-11-19 08:14:32,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:14:29" (2/3) ... [2022-11-19 08:14:32,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1931dee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:14:32, skipping insertion in model container [2022-11-19 08:14:32,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:14:32" (3/3) ... [2022-11-19 08:14:32,143 INFO L112 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2022-11-19 08:14:32,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:14:32,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 08:14:32,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:14:32,222 INFO L357 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64f20d0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:14:32,222 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 08:14:32,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 08:14:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 08:14:32,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:32,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:32,247 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:14:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:32,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2022-11-19 08:14:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:14:32,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985339432] [2022-11-19 08:14:32,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:32,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:14:32,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:14:32,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:14:32,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-19 08:14:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:32,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 08:14:32,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:32,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:32,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:14:32,460 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:14:32,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985339432] [2022-11-19 08:14:32,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985339432] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:32,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:14:32,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:14:32,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977482672] [2022-11-19 08:14:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:32,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:14:32,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:14:32,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:14:32,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:14:32,540 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:32,567 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-11-19 08:14:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:14:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-19 08:14:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:32,586 INFO L225 Difference]: With dead ends: 32 [2022-11-19 08:14:32,586 INFO L226 Difference]: Without dead ends: 13 [2022-11-19 08:14:32,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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-11-19 08:14:32,592 INFO L413 NwaCegarLoop]: 19 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, 19 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-11-19 08:14:32,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:14:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-19 08:14:32,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-19 08:14:32,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 08:14:32,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-11-19 08:14:32,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-11-19 08:14:32,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:32,646 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-11-19 08:14:32,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:32,646 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-11-19 08:14:32,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 08:14:32,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:32,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:32,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:32,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:14:32,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:14:32,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:32,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2022-11-19 08:14:32,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:14:32,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487990174] [2022-11-19 08:14:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:32,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:14:32,881 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:14:32,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:14:32,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-19 08:14:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:32,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 08:14:32,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:33,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:33,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:14:33,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:14:33,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487990174] [2022-11-19 08:14:33,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487990174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:33,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:14:33,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 08:14:33,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044988750] [2022-11-19 08:14:33,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:33,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 08:14:33,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:14:33,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 08:14:33,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 08:14:33,029 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:35,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:14:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:35,180 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-11-19 08:14:35,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 08:14:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-19 08:14:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:35,182 INFO L225 Difference]: With dead ends: 21 [2022-11-19 08:14:35,182 INFO L226 Difference]: Without dead ends: 14 [2022-11-19 08:14:35,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-19 08:14:35,184 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:35,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-11-19 08:14:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-19 08:14:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-19 08:14:35,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-19 08:14:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-11-19 08:14:35,190 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-11-19 08:14:35,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:35,191 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-11-19 08:14:35,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:35,192 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-11-19 08:14:35,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 08:14:35,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:35,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:35,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:35,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:14:35,407 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:14:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2022-11-19 08:14:35,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:14:35,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064196235] [2022-11-19 08:14:35,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:35,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:14:35,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:14:35,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:14:35,411 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-19 08:14:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:35,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:14:35,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:36,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:36,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:14:36,552 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:14:36,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064196235] [2022-11-19 08:14:36,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064196235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:14:36,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:14:36,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 08:14:36,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223328545] [2022-11-19 08:14:36,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:36,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 08:14:36,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:14:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 08:14:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 08:14:36,554 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:38,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:14:40,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:14:43,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:14:45,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:14:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:14:45,011 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-11-19 08:14:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:14:45,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-19 08:14:45,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:14:45,042 INFO L225 Difference]: With dead ends: 31 [2022-11-19 08:14:45,042 INFO L226 Difference]: Without dead ends: 29 [2022-11-19 08:14:45,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-19 08:14:45,044 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 20 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:14:45,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 3 Unknown, 0 Unchecked, 8.4s Time] [2022-11-19 08:14:45,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-19 08:14:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-19 08:14:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 08:14:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-19 08:14:45,058 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2022-11-19 08:14:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:14:45,058 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-19 08:14:45,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:14:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-19 08:14:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 08:14:45,059 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:14:45,059 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:14:45,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-19 08:14:45,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:14:45,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:14:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:14:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1269539930, now seen corresponding path program 1 times [2022-11-19 08:14:45,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:14:45,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865412988] [2022-11-19 08:14:45,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:14:45,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:14:45,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:14:45,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:14:45,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-19 08:14:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:14:45,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 08:14:45,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:14:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:46,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:14:56,068 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-11-19 08:14:58,092 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-11-19 08:14:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:14:58,109 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:14:58,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865412988] [2022-11-19 08:14:58,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865412988] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 08:14:58,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 08:14:58,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-11-19 08:14:58,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752331993] [2022-11-19 08:14:58,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:14:58,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:14:58,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:14:58,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:14:58,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=67, Unknown=2, NotChecked=16, Total=110 [2022-11-19 08:14:58,113 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 08:15:00,152 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from false [2022-11-19 08:15:02,174 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq .cse0 .cse1) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1))) is different from true [2022-11-19 08:15:04,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:15:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:04,521 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-11-19 08:15:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 08:15:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-19 08:15:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:04,523 INFO L225 Difference]: With dead ends: 33 [2022-11-19 08:15:04,523 INFO L226 Difference]: Without dead ends: 29 [2022-11-19 08:15:04,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2022-11-19 08:15:04,525 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:04,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 46 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 1 Unknown, 23 Unchecked, 2.3s Time] [2022-11-19 08:15:04,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-19 08:15:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-19 08:15:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 08:15:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-11-19 08:15:04,535 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2022-11-19 08:15:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:04,536 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-11-19 08:15:04,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-19 08:15:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-11-19 08:15:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 08:15:04,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:04,537 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:04,549 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:04,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:15:04,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:15:04,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:04,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1102679400, now seen corresponding path program 1 times [2022-11-19 08:15:04,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:15:04,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035439509] [2022-11-19 08:15:04,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:04,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:15:04,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:15:04,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:15:04,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-19 08:15:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:04,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:15:04,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:15:05,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:15:05,147 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:15:05,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035439509] [2022-11-19 08:15:05,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035439509] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:05,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007982779] [2022-11-19 08:15:05,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:05,148 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:15:05,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:15:05,155 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:15:05,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-19 08:15:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:05,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:15:05,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:15:05,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:05,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:15:05,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2007982779] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:05,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947923685] [2022-11-19 08:15:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:05,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:15:05,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:15:05,619 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:15:05,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 08:15:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:05,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 08:15:05,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:05,876 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:15:05,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:15:05,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947923685] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:15:05,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:15:05,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2022-11-19 08:15:05,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959008431] [2022-11-19 08:15:05,923 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:15:05,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 08:15:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:15:05,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 08:15:05,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:15:05,924 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-19 08:15:08,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:15:10,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:15:10,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:15:10,329 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-11-19 08:15:10,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 08:15:10,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2022-11-19 08:15:10,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:15:10,331 INFO L225 Difference]: With dead ends: 40 [2022-11-19 08:15:10,331 INFO L226 Difference]: Without dead ends: 30 [2022-11-19 08:15:10,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-19 08:15:10,332 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-19 08:15:10,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2022-11-19 08:15:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-11-19 08:15:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-11-19 08:15:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-19 08:15:10,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-11-19 08:15:10,346 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2022-11-19 08:15:10,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:15:10,348 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-11-19 08:15:10,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-19 08:15:10,348 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-11-19 08:15:10,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 08:15:10,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:15:10,349 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:15:10,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:10,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:10,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-19 08:15:10,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:15:10,966 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:15:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:15:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1100951522, now seen corresponding path program 1 times [2022-11-19 08:15:10,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:15:10,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045051884] [2022-11-19 08:15:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:15:10,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:15:10,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:15:10,969 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:15:10,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-19 08:15:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:15:11,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 08:15:11,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:15:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:15:16,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:15:27,047 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2022-11-19 08:16:02,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-11-19 08:16:04,281 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-11-19 08:16:04,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-19 08:16:04,314 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:16:04,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045051884] [2022-11-19 08:16:04,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045051884] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:04,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [373168769] [2022-11-19 08:16:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:04,315 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:16:04,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:16:04,316 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:16:04,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-19 08:16:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:04,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 08:16:04,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:16:05,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:16:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-11-19 08:16:45,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [373168769] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:16:45,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364223319] [2022-11-19 08:16:45,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:16:45,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:16:45,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:16:45,820 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:16:45,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 08:16:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:16:54,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-19 08:16:54,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:16:55,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 08:16:55,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:17:30,158 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))))) (and (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))))) is different from true [2022-11-19 08:17:56,625 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) is different from true [2022-11-19 08:18:31,208 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) is different from false [2022-11-19 08:18:33,299 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) is different from true [2022-11-19 08:18:55,879 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) (fp.leq (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) .cse0))) is different from false [2022-11-19 08:18:57,902 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse0)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) (fp.leq (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) .cse0))) is different from true [2022-11-19 08:21:21,844 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-19 08:22:21,528 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-19 08:23:22,759 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-11-19 08:23:24,869 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-11-19 08:23:48,107 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2)) .cse4) (not (fp.leq .cse3 .cse4)) (not (fp.leq .cse1 .cse4)) (not (fp.geq .cse3 (_ +zero 8 24))) (not (fp.geq .cse1 (_ +zero 8 24)))))) is different from false [2022-11-19 08:23:50,185 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) (.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)))) (or (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2)) .cse4) (not (fp.leq .cse3 .cse4)) (not (fp.leq .cse1 .cse4)) (not (fp.geq .cse3 (_ +zero 8 24))) (not (fp.geq .cse1 (_ +zero 8 24)))))) is different from true [2022-11-19 08:23:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 7 not checked. [2022-11-19 08:23:50,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364223319] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:23:50,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-19 08:23:50,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 9, 14] total 23 [2022-11-19 08:23:50,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288545834] [2022-11-19 08:23:50,219 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-19 08:23:50,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-19 08:23:50,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:23:50,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-19 08:23:50,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=125, Unknown=17, NotChecked=310, Total=506 [2022-11-19 08:23:50,221 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 23 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-19 08:23:52,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:23:54,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:23:56,415 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse6) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse6))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse6)))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) .cse6) (fp.div c_currentRoundingMode .cse2 .cse6))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 (fp.leq .cse1 .cse3))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse0 (fp.geq .cse1 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (or .cse0 (not (fp.leq .cse2 .cse3)) (not (fp.leq .cse4 .cse3)) (not (fp.geq .cse2 (_ +zero 8 24))) (not (fp.geq .cse4 (_ +zero 8 24)))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from false [2022-11-19 08:23:58,488 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~x1~0#1|) .cse6) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse6))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 |c_ULTIMATE.start_main_~y1~0#1|) .cse6)))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 .cse4) .cse6) (fp.div c_currentRoundingMode .cse2 .cse6))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 (fp.leq .cse1 .cse3))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 12.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse0 (fp.geq .cse1 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (or .cse0 (not (fp.leq .cse2 .cse3)) (not (fp.leq .cse4 .cse3)) (not (fp.geq .cse2 (_ +zero 8 24))) (not (fp.geq .cse4 (_ +zero 8 24)))) (= c_currentRoundingMode roundNearestTiesToEven)))))) is different from true [2022-11-19 08:24:01,449 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse5 (fp.leq .cse4 .cse6))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) .cse5 (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse6)) (not (fp.leq |c_ULTIMATE.start_main_~x1~0#1| .cse6)) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.geq |c_ULTIMATE.start_main_~x1~0#1| (_ +zero 8 24))) .cse5))))) is different from true [2022-11-19 08:24:03,683 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse4 .cse5) (or (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse5) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0)))))) .cse4) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-19 08:24:05,893 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3) .cse3 (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-19 08:24:08,109 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))) .cse3 (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-19 08:24:10,602 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.geq .cse7 (_ +zero 8 24))) (.cse6 (fp.leq .cse7 .cse5))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) .cse4 (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (or (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse5)) (and .cse4 .cse6) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)))) .cse6 (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-11-19 08:24:13,054 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) (and (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse0 .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse1))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse0) .cse1) (fp.div c_currentRoundingMode .cse3 .cse1))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-11-19 08:24:15,508 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (= (_ bv0 32) c___VERIFIER_assert_~cond)) (.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse4 .cse5) (or (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse5) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0)))))) .cse4) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) .cse5 (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-11-19 08:24:17,590 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse4 .cse5) (or (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse5) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0)))))) .cse4))) is different from false [2022-11-19 08:24:19,777 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse4 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.leq .cse1 .cse0)) (fp.geq .cse1 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse0) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse3)) .cse0) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse4 .cse5) (or (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse5) (or .cse5 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse3) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse3)) .cse0)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse0)))))) .cse4))) is different from true [2022-11-19 08:24:21,984 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3))) is different from true [2022-11-19 08:24:24,016 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) is different from false [2022-11-19 08:24:26,203 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (or (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ +zero 8 24))))) .cse3) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.leq .cse4 .cse2)) (fp.geq .cse4 (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24)))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24)))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) (_ +zero 8 24)) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.leq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| .cse2))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (or (not (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| .cse1)) .cse2) (not (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_15| (_ +zero 8 24))))) (fp.geq |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_16| (_ +zero 8 24))))) .cse3) (or .cse3 (and (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.geq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) (_ +zero 8 24))) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))) (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| (_ FloatingPoint 8 24))) (or (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15| (_ FloatingPoint 8 24))) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_15|) .cse1) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse1)) .cse2)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_14| .cse2))))))) is different from true [2022-11-19 08:24:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:24:26,391 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-11-19 08:24:26,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-19 08:24:26,396 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 19 [2022-11-19 08:24:26,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:24:26,397 INFO L225 Difference]: With dead ends: 36 [2022-11-19 08:24:26,397 INFO L226 Difference]: Without dead ends: 34 [2022-11-19 08:24:26,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 71.3s TimeCoverageRelationStatistics Valid=82, Invalid=153, Unknown=31, NotChecked=924, Total=1190 [2022-11-19 08:24:26,399 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-19 08:24:26,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 41 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 2 Unknown, 162 Unchecked, 4.5s Time] [2022-11-19 08:24:26,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-19 08:24:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-19 08:24:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-19 08:24:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-11-19 08:24:26,415 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 19 [2022-11-19 08:24:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:24:26,416 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-11-19 08:24:26,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 20 states have internal predecessors, (32), 6 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-19 08:24:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-11-19 08:24:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 08:24:26,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:24:26,417 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-19 08:24:26,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:26,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:26,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-11-19 08:24:27,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt [2022-11-19 08:24:27,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:24:27,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:24:27,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1943528346, now seen corresponding path program 2 times [2022-11-19 08:24:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:24:27,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309152891] [2022-11-19 08:24:27,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:24:27,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 08:24:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:24:27,020 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-19 08:24:27,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-19 08:24:27,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:24:27,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:24:27,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 08:24:27,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:24:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:24:33,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:24:44,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-11-19 08:24:46,155 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-11-19 08:25:20,976 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2022-11-19 08:25:23,048 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2022-11-19 08:25:23,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2022-11-19 08:25:23,072 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:25:23,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309152891] [2022-11-19 08:25:23,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309152891] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:25:23,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [146834162] [2022-11-19 08:25:23,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:25:23,073 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:25:23,073 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:25:23,074 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:25:23,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-11-19 08:25:23,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:25:23,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:25:23,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 08:25:23,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:25:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 08:25:24,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:26:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2022-11-19 08:26:02,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [146834162] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:26:02,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689866721] [2022-11-19 08:26:02,546 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 08:26:02,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 08:26:02,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:26:02,555 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 08:26:02,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_118f477f-e446-4bdc-ba7f-41ffdf2d08c1/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 08:26:30,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-19 08:26:30,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 08:26:30,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-19 08:26:30,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:26:59,511 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (and (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse0) (= (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |ULTIMATE.start_main_~x~0#1|) .cse2) (fp.div c_currentRoundingMode |ULTIMATE.start_main_~y~0#1| .cse2)) |c_ULTIMATE.start_main_~x1~0#1|) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |ULTIMATE.start_main_~y~0#1|) .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-19 08:27:28,075 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (and (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse0) (fp.leq (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |ULTIMATE.start_main_~x~0#1|) .cse2) (fp.div c_currentRoundingMode |ULTIMATE.start_main_~y~0#1| .cse2)) .cse0) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |ULTIMATE.start_main_~y~0#1|) .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-19 08:29:27,639 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 3.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 4.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 100.0))) (or (and (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24)) (|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse0) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~y~0#1|) .cse0)) .cse2) (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|) .cse0) (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~y~0#1| .cse0)) .cse2) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse2))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (or (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse2) (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|) .cse0) (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~y~0#1| .cse0)) .cse2) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse2) (not (fp.geq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse0) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~y~0#1|) .cse0)) (_ +zero 8 24))))))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~x~0#1| (_ +zero 8 24)) (fp.leq |ULTIMATE.start_main_~x~0#1| .cse2) (exists ((|ULTIMATE.start_main_~y~0#1| (_ FloatingPoint 8 24))) (and (fp.geq |ULTIMATE.start_main_~y~0#1| (_ +zero 8 24)) (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|) .cse0) (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~y~0#1| .cse0)) .cse2) (fp.leq |ULTIMATE.start_main_~y~0#1| .cse2) (not (fp.leq (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse0) (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~y~0#1|) .cse0)) .cse2)))))))))) is different from false