./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:17:46,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:17:46,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:17:46,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:17:46,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:17:46,308 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:17:46,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:17:46,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:17:46,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:17:46,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:17:46,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:17:46,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:17:46,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:17:46,323 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:17:46,325 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:17:46,327 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:17:46,328 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:17:46,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:17:46,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:17:46,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:17:46,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:17:46,340 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:17:46,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:17:46,344 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:17:46,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:17:46,349 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:17:46,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:17:46,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:17:46,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:17:46,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:17:46,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:17:46,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:17:46,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:17:46,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:17:46,358 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:17:46,359 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:17:46,360 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:17:46,360 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:17:46,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:17:46,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:17:46,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:17:46,364 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-02 22:17:46,392 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:17:46,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:17:46,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:17:46,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:17:46,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:17:46,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:17:46,401 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:17:46,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:17:46,402 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:17:46,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-02 22:17:46,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:17:46,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:17:46,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 22:17:46,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:17:46,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 22:17:46,404 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:17:46,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:17:46,405 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:17:46,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 22:17:46,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:17:46,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:17:46,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:17:46,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:17:46,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:17:46,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:17:46,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 22:17:46,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-02 22:17:46,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-02 22:17:46,408 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 22:17:46,408 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 22:17:46,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 22:17:46,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:17:46,410 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_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/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_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2021-11-02 22:17:46,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:17:46,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:17:46,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:17:46,732 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:17:46,733 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:17:46,734 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-02 22:17:46,814 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data/e7293d38d/a97595611baf4c8c92f38fd2a6f98638/FLAG57d2bbed2 [2021-11-02 22:17:47,373 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:17:47,376 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-02 22:17:47,390 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data/e7293d38d/a97595611baf4c8c92f38fd2a6f98638/FLAG57d2bbed2 [2021-11-02 22:17:47,678 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data/e7293d38d/a97595611baf4c8c92f38fd2a6f98638 [2021-11-02 22:17:47,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:17:47,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:17:47,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:17:47,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:17:47,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:17:47,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:17:47" (1/1) ... [2021-11-02 22:17:47,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42dd286d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:47, skipping insertion in model container [2021-11-02 22:17:47,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:17:47" (1/1) ... [2021-11-02 22:17:47,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:17:47,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:17:47,958 WARN L228 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_c0bce546-c9a6-4d06-b18b-699bed68b7a9/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-02 22:17:47,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:17:47,976 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:17:47,999 WARN L228 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_c0bce546-c9a6-4d06-b18b-699bed68b7a9/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-02 22:17:48,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:17:48,019 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:17:48,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48 WrapperNode [2021-11-02 22:17:48,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:17:48,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:17:48,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:17:48,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:17:48,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:17:48,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:17:48,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:17:48,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:17:48,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:17:48,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:17:48,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:17:48,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:17:48,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (1/1) ... [2021-11-02 22:17:48,138 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:17:48,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:17:48,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:17:48,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:17:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-02 22:17:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:17:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-02 22:17:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:17:48,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:17:48,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-02 22:17:48,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:17:48,476 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:17:48,476 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-02 22:17:48,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:17:48 BoogieIcfgContainer [2021-11-02 22:17:48,479 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:17:48,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:17:48,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:17:48,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:17:48,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:17:47" (1/3) ... [2021-11-02 22:17:48,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad586b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:17:48, skipping insertion in model container [2021-11-02 22:17:48,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:48" (2/3) ... [2021-11-02 22:17:48,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad586b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:17:48, skipping insertion in model container [2021-11-02 22:17:48,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:17:48" (3/3) ... [2021-11-02 22:17:48,499 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2021-11-02 22:17:48,517 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:17:48,517 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-02 22:17:48,583 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:17:48,590 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-02 22:17:48,591 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-02 22:17:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:17:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-02 22:17:48,613 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:17:48,614 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:17:48,614 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:17:48,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:17:48,620 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2021-11-02 22:17:48,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:17:48,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426564323] [2021-11-02 22:17:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:17:48,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:17:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:17:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:17:48,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-02 22:17:48,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426564323] [2021-11-02 22:17:48,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426564323] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-02 22:17:48,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:17:48,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-02 22:17:48,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690953702] [2021-11-02 22:17:48,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-02 22:17:48,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-02 22:17:48,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-02 22:17:48,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-02 22:17:48,943 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:17:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:17:49,054 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2021-11-02 22:17:49,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-02 22:17:49,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-02 22:17:49,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:17:49,069 INFO L225 Difference]: With dead ends: 41 [2021-11-02 22:17:49,069 INFO L226 Difference]: Without dead ends: 22 [2021-11-02 22:17:49,074 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-02 22:17:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-02 22:17:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-02 22:17:49,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:17:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-11-02 22:17:49,115 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2021-11-02 22:17:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:17:49,116 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-11-02 22:17:49,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:17:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-11-02 22:17:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-02 22:17:49,119 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:17:49,119 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:17:49,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-02 22:17:49,120 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:17:49,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:17:49,124 INFO L85 PathProgramCache]: Analyzing trace with hash 792769235, now seen corresponding path program 1 times [2021-11-02 22:17:49,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-02 22:17:49,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068775660] [2021-11-02 22:17:49,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:17:49,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-02 22:17:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:17:49,208 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-02 22:17:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-02 22:17:49,286 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-02 22:17:49,287 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-02 22:17:49,293 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-02 22:17:49,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-02 22:17:49,299 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-02 22:17:49,303 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-02 22:17:49,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 10:17:49 BoogieIcfgContainer [2021-11-02 22:17:49,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-02 22:17:49,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-02 22:17:49,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-02 22:17:49,377 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-02 22:17:49,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:17:48" (3/4) ... [2021-11-02 22:17:49,383 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-02 22:17:49,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-02 22:17:49,386 INFO L168 Benchmark]: Toolchain (without parser) took 1701.77 ms. Allocated memory is still 98.6 MB. Free memory was 60.5 MB in the beginning and 61.2 MB in the end (delta: -721.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:17:49,387 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 98.6 MB. Free memory is still 78.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:17:49,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.59 ms. Allocated memory is still 98.6 MB. Free memory was 60.3 MB in the beginning and 72.6 MB in the end (delta: -12.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-02 22:17:49,391 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.60 ms. Allocated memory is still 98.6 MB. Free memory was 72.6 MB in the beginning and 70.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:17:49,392 INFO L168 Benchmark]: Boogie Preprocessor took 57.43 ms. Allocated memory is still 98.6 MB. Free memory was 70.6 MB in the beginning and 68.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-02 22:17:49,398 INFO L168 Benchmark]: RCFGBuilder took 353.95 ms. Allocated memory is still 98.6 MB. Free memory was 68.9 MB in the beginning and 55.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-11-02 22:17:49,398 INFO L168 Benchmark]: TraceAbstraction took 894.60 ms. Allocated memory is still 98.6 MB. Free memory was 55.3 MB in the beginning and 61.7 MB in the end (delta: -6.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:17:49,399 INFO L168 Benchmark]: Witness Printer took 7.05 ms. Allocated memory is still 98.6 MB. Free memory was 61.7 MB in the beginning and 61.2 MB in the end (delta: 535.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-02 22:17:49,407 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 98.6 MB. Free memory is still 78.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 335.59 ms. Allocated memory is still 98.6 MB. Free memory was 60.3 MB in the beginning and 72.6 MB in the end (delta: -12.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.60 ms. Allocated memory is still 98.6 MB. Free memory was 72.6 MB in the beginning and 70.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.43 ms. Allocated memory is still 98.6 MB. Free memory was 70.6 MB in the beginning and 68.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 353.95 ms. Allocated memory is still 98.6 MB. Free memory was 68.9 MB in the beginning and 55.9 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 894.60 ms. Allocated memory is still 98.6 MB. Free memory was 55.3 MB in the beginning and 61.7 MB in the end (delta: -6.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 7.05 ms. Allocated memory is still 98.6 MB. Free memory was 61.7 MB in the beginning and 61.2 MB in the end (delta: 535.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 53]: 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 34, overapproximation of someBinaryDOUBLEComparisonOperation at line 40, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 38. Possible FailurePath: [L1] int __return_main; [L12] int __return_136; VAL [__return_136=0, __return_main=0] [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] float main__org[5] = { 1, 5, -10, 30, 20 }; [L21] float main__slope[5] = { 4, -15, 40, -10, 0 }; [L22] main__t = __VERIFIER_nondet_float() [L23] int main____CPAchecker_TMP_0; [L24] EXPR main__min[0] VAL [__return_136=0, __return_main=0] [L24] COND TRUE main__t >= (main__min[0]) [L26] EXPR main__max[4UL] VAL [__return_136=0, __return_main=0] [L26] COND TRUE main__t <= (main__max[4UL]) [L28] main____CPAchecker_TMP_0 = 1 VAL [__return_136=0, __return_main=0] [L29] COND TRUE main____CPAchecker_TMP_0 != 0 [L31] main__i = 0 VAL [__return_136=0, __return_main=0] [L32] COND TRUE main__i < 5UL [L34] EXPR main__max[main__i] VAL [__return_136=0, __return_main=0] [L34] COND TRUE main__t <= (main__max[main__i]) [L38] EXPR main__org[main__i] [L38] EXPR main__slope[main__i] [L38] EXPR main__min[main__i] [L38] EXPR main__max[main__i] [L38] EXPR main__min[main__i] [L38] main__z = (main__org[main__i]) + (((main__slope[main__i]) * (main__t - (main__min[main__i]))) / ((main__max[main__i]) - (main__min[main__i]))) [L39] int main____CPAchecker_TMP_1; VAL [__return_136=0, __return_main=0] [L40] COND FALSE !(main__z >= -10.0) VAL [__return_136=0, __return_main=0] [L66] main____CPAchecker_TMP_1 = 0 VAL [__return_136=0, __return_main=0] [L47] int __tmp_1; [L48] __tmp_1 = main____CPAchecker_TMP_1 [L49] int __VERIFIER_assert__cond; [L50] __VERIFIER_assert__cond = __tmp_1 VAL [__return_136=0, __return_main=0] [L51] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_136=0, __return_main=0] [L53] reach_error() VAL [__return_136=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 37 SDtfs, 41 SDslu, 73 SDs, 0 SdLazy, 13 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-02 22:17:49,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-02 22:17:52,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-02 22:17:52,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-02 22:17:52,254 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-02 22:17:52,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-02 22:17:52,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-02 22:17:52,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-02 22:17:52,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-02 22:17:52,274 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-02 22:17:52,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-02 22:17:52,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-02 22:17:52,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-02 22:17:52,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-02 22:17:52,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-02 22:17:52,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-02 22:17:52,296 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-02 22:17:52,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-02 22:17:52,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-02 22:17:52,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-02 22:17:52,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-02 22:17:52,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-02 22:17:52,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-02 22:17:52,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-02 22:17:52,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-02 22:17:52,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-02 22:17:52,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-02 22:17:52,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-02 22:17:52,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-02 22:17:52,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-02 22:17:52,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-02 22:17:52,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-02 22:17:52,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-02 22:17:52,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-02 22:17:52,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-02 22:17:52,342 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-02 22:17:52,342 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-02 22:17:52,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-02 22:17:52,344 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-02 22:17:52,344 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-02 22:17:52,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-02 22:17:52,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-02 22:17:52,353 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-02 22:17:52,402 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-02 22:17:52,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-02 22:17:52,403 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-02 22:17:52,403 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-02 22:17:52,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-02 22:17:52,406 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-02 22:17:52,406 INFO L138 SettingsManager]: * Use SBE=true [2021-11-02 22:17:52,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-02 22:17:52,407 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-02 22:17:52,407 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-02 22:17:52,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-02 22:17:52,413 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-02 22:17:52,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-02 22:17:52,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-02 22:17:52,414 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-02 22:17:52,414 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-02 22:17:52,414 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-02 22:17:52,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-02 22:17:52,415 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-02 22:17:52,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-02 22:17:52,415 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-02 22:17:52,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-02 22:17:52,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-02 22:17:52,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:17:52,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-02 22:17:52,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-02 22:17:52,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-02 22:17:52,418 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-02 22:17:52,418 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-02 22:17:52,418 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-02 22:17:52,418 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-02 22:17:52,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-02 22:17:52,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-02 22:17:52,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-02 22:17:52,420 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_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/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_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b786ed311f07fa83d19e15eff80ed0c31b01d28b674f6a431fdb0a4267861a0f [2021-11-02 22:17:52,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-02 22:17:52,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-02 22:17:52,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-02 22:17:52,831 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-02 22:17:52,832 INFO L275 PluginConnector]: CDTParser initialized [2021-11-02 22:17:52,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/../../sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-02 22:17:52,902 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data/835b0792a/60395bccfcbd45aca01ee039913de3ba/FLAG082ac422d [2021-11-02 22:17:53,450 INFO L306 CDTParser]: Found 1 translation units. [2021-11-02 22:17:53,451 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c [2021-11-02 22:17:53,461 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data/835b0792a/60395bccfcbd45aca01ee039913de3ba/FLAG082ac422d [2021-11-02 22:17:53,806 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/data/835b0792a/60395bccfcbd45aca01ee039913de3ba [2021-11-02 22:17:53,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-02 22:17:53,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-02 22:17:53,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-02 22:17:53,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-02 22:17:53,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-02 22:17:53,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:17:53" (1/1) ... [2021-11-02 22:17:53,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b80f513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:53, skipping insertion in model container [2021-11-02 22:17:53,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 10:17:53" (1/1) ... [2021-11-02 22:17:53,850 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-02 22:17:53,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-02 22:17:54,037 WARN L228 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_c0bce546-c9a6-4d06-b18b-699bed68b7a9/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-02 22:17:54,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:17:54,080 INFO L203 MainTranslator]: Completed pre-run [2021-11-02 22:17:54,147 WARN L228 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_c0bce546-c9a6-4d06-b18b-699bed68b7a9/sv-benchmarks/c/float-benchs/interpolation2.c.v+nlh-reducer.c[1463,1476] [2021-11-02 22:17:54,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-02 22:17:54,177 INFO L208 MainTranslator]: Completed translation [2021-11-02 22:17:54,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54 WrapperNode [2021-11-02 22:17:54,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-02 22:17:54,179 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-02 22:17:54,179 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-02 22:17:54,179 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-02 22:17:54,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-02 22:17:54,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-02 22:17:54,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-02 22:17:54,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-02 22:17:54,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-02 22:17:54,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-02 22:17:54,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-02 22:17:54,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-02 22:17:54,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (1/1) ... [2021-11-02 22:17:54,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-02 22:17:54,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/z3 [2021-11-02 22:17:54,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-02 22:17:54,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-02 22:17:54,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-02 22:17:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-02 22:17:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-02 22:17:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-02 22:17:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-02 22:17:54,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-02 22:17:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-02 22:17:57,304 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-02 22:17:57,304 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-11-02 22:17:57,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:17:57 BoogieIcfgContainer [2021-11-02 22:17:57,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-02 22:17:57,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-02 22:17:57,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-02 22:17:57,313 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-02 22:17:57,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 10:17:53" (1/3) ... [2021-11-02 22:17:57,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c247eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:17:57, skipping insertion in model container [2021-11-02 22:17:57,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 10:17:54" (2/3) ... [2021-11-02 22:17:57,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c247eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 10:17:57, skipping insertion in model container [2021-11-02 22:17:57,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 10:17:57" (3/3) ... [2021-11-02 22:17:57,317 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c.v+nlh-reducer.c [2021-11-02 22:17:57,323 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-02 22:17:57,324 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-02 22:17:57,381 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-02 22:17:57,389 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-02 22:17:57,389 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-02 22:17:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:17:57,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-02 22:17:57,412 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:17:57,413 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:17:57,414 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:17:57,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:17:57,421 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2021-11-02 22:17:57,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:17:57,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388843946] [2021-11-02 22:17:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:17:57,438 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:17:57,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:17:57,459 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:17:57,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-02 22:17:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:17:58,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-02 22:17:58,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:17:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:17:58,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:17:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:17:58,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:17:58,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388843946] [2021-11-02 22:17:58,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388843946] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:17:58,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:17:58,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-11-02 22:17:58,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571616131] [2021-11-02 22:17:58,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-02 22:17:58,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:17:58,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-02 22:17:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-02 22:17:58,536 INFO L87 Difference]: Start difference. First operand has 25 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 24 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:18:03,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:18:03,071 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2021-11-02 22:18:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-02 22:18:03,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-02 22:18:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:18:03,082 INFO L225 Difference]: With dead ends: 38 [2021-11-02 22:18:03,083 INFO L226 Difference]: Without dead ends: 22 [2021-11-02 22:18:03,087 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-02 22:18:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-11-02 22:18:03,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-11-02 22:18:03,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:18:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-11-02 22:18:03,123 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 13 [2021-11-02 22:18:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:18:03,124 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-11-02 22:18:03,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:18:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2021-11-02 22:18:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-02 22:18:03,126 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:18:03,126 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:18:03,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-11-02 22:18:03,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:18:03,347 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:18:03,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:18:03,348 INFO L85 PathProgramCache]: Analyzing trace with hash 792769235, now seen corresponding path program 1 times [2021-11-02 22:18:03,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:18:03,351 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949250515] [2021-11-02 22:18:03,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:18:03,351 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:18:03,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:18:03,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:18:03,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-02 22:18:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:18:03,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-02 22:18:03,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:18:11,650 WARN L207 SmtUtils]: Spent 5.03 s on a formula simplification. DAG size of input: 33 DAG size of output: 17 [2021-11-02 22:18:11,652 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-02 22:18:11,653 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2021-11-02 22:20:01,693 WARN L207 SmtUtils]: Spent 21.93 s on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2021-11-02 22:21:27,811 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)))) is different from false [2021-11-02 22:21:29,843 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)) .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10.0)))) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)))) is different from true [2021-11-02 22:25:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:25:41,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-02 22:25:51,479 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from false [2021-11-02 22:25:53,586 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) is different from true [2021-11-02 22:26:04,309 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from false [2021-11-02 22:26:06,415 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse1 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse1)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) .cse3)))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) is different from true [2021-11-02 22:26:17,143 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2021-11-02 22:26:19,250 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse0)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2021-11-02 22:26:29,955 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)))) is different from false [2021-11-02 22:26:32,061 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)))) is different from true [2021-11-02 22:26:47,119 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)))) is different from false [2021-11-02 22:26:49,221 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|) |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)))) is different from true [2021-11-02 22:27:08,791 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) is different from false [2021-11-02 22:27:10,902 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) (let ((.cse2 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse5 (select .cse6 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))) is different from true [2021-11-02 22:28:43,350 WARN L207 SmtUtils]: Spent 1.54 m on a formula simplification. DAG size of input: 33 DAG size of output: 11 [2021-11-02 22:28:43,352 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-02 22:28:43,352 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 300 treesize of output 162 [2021-11-02 22:30:16,938 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_10 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from false [2021-11-02 22:30:19,045 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_10 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-02 22:30:19,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-02 22:30:19,046 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-02 22:30:19,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949250515] [2021-11-02 22:30:19,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949250515] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-02 22:30:19,047 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-02 22:30:19,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-02 22:30:19,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036827871] [2021-11-02 22:30:19,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-02 22:30:19,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-02 22:30:19,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-02 22:30:19,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=71, Unknown=24, NotChecked=200, Total=342 [2021-11-02 22:30:19,052 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:30:21,691 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_10 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-02 22:30:23,793 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9)))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse3)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))))))) (forall ((v_arrayElimCell_10 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-02 22:30:25,847 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse3 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (and (= (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (= (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse3 |c_ULTIMATE.start_main_#t~mem8|) (= (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse9 (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) (let ((.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse8)) (fp.sub c_currentRoundingMode .cse9 .cse8))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse9)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse11 (select .cse12 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))))) is different from false [2021-11-02 22:30:27,958 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse3 (let ((.cse14 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (and (= (let ((.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= (let ((.cse1 (select .cse2 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (= (let ((.cse4 (select .cse2 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse3 |c_ULTIMATE.start_main_#t~mem8|) (= (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (forall ((ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24))) (let ((.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse9 (let ((.cse13 (select .cse12 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) (let ((.cse8 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse8)) (fp.sub c_currentRoundingMode .cse9 .cse8))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq ULTIMATE.start_main_~main__t~0 .cse9)) (not (fp.leq ULTIMATE.start_main_~main__t~0 (let ((.cse11 (select .cse12 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (not (fp.geq ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem8|)))))))) is different from true [2021-11-02 22:30:31,913 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse2 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse3 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse1 |c_ULTIMATE.start_main_#t~mem9|) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse2) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem9|)) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-02 22:30:33,969 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse4))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse3) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from false [2021-11-02 22:30:36,077 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse1 (let ((.cse10 (select .cse7 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse0 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|) |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|) |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse4 (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse2 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|) |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (and (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse1) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse4))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse3) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-02 22:30:38,134 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse2 (let ((.cse17 (select .cse12 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse13 (let ((.cse16 (select .cse10 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (let ((.cse5 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse3 (let ((.cse11 (select .cse12 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse10 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse8)) (fp.sub c_currentRoundingMode .cse3 .cse8))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) (= .cse13 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse13) (= (let ((.cse14 (select .cse12 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse15 (select .cse7 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from false [2021-11-02 22:30:40,235 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse12 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse2 (let ((.cse17 (select .cse12 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse13 (let ((.cse16 (select .cse10 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (let ((.cse5 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32)))) (let ((.cse3 (let ((.cse11 (select .cse12 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))))) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse4 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse10 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse5)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse8)) (fp.sub c_currentRoundingMode .cse3 .cse8))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) (= .cse13 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse13) (= (let ((.cse14 (select .cse12 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse15 (select .cse7 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-02 22:30:42,284 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse6 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32))) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse17 (select .cse13 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse2 (let ((.cse16 (select .cse13 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse4 (let ((.cse15 (select .cse11 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_#t~mem10| .cse2) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse5 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse9 (let ((.cse10 (select .cse11 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse9)) (fp.sub c_currentRoundingMode .cse2 .cse9))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse4) (= (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse14 (select .cse8 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from false [2021-11-02 22:30:44,385 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|)) (.cse6 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32))) (.cse13 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|))) (let ((.cse3 (let ((.cse17 (select .cse13 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse2 (let ((.cse16 (select .cse13 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse4 (let ((.cse15 (select .cse11 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_#t~mem10| .cse2) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse3) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (or (not (fp.leq c_ULTIMATE.start_main_~main__t~0 |c_ULTIMATE.start_main_#t~mem10|)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse5 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (let ((.cse9 (let ((.cse10 (select .cse11 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse6)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse9)) (fp.sub c_currentRoundingMode .cse2 .cse9))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse4) (= (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse14 (select .cse8 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32))))) is different from true [2021-11-02 22:30:46,459 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse10 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|))) (let ((.cse5 (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|)) (.cse2 (let ((.cse15 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2) (= (let ((.cse3 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse5) (= (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse9 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (let ((.cse12 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse11 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse12)) (fp.sub c_currentRoundingMode .cse2 .cse12))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from false [2021-11-02 22:30:48,562 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0.base|)) (.cse10 (bvmul c_ULTIMATE.start_main_~main__i~0 (_ bv4 32))) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0.base|))) (let ((.cse5 (let ((.cse16 (select .cse14 |c_ULTIMATE.start_main_~#main__min~0.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__org~0.base|)) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__slope~0.base|)) (.cse2 (let ((.cse15 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (and (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#main__org~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#main__slope~0.offset| (_ bv0 32)) (fp.leq c_ULTIMATE.start_main_~main__t~0 .cse2) (= (let ((.cse3 (select .cse4 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#main__max~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= |c_ULTIMATE.start_main_~#main__org~0.offset| (_ bv0 32)) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#main__min~0.offset| (_ bv0 32)) (fp.geq c_ULTIMATE.start_main_~main__t~0 .cse5) (= (let ((.cse6 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#main__max~0.offset| (_ bv0 32)) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#main__slope~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= c_ULTIMATE.start_main_~main__i~0 (_ bv0 32)) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse9 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__org~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (let ((.cse12 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#main__min~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse11 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#main__slope~0.offset| .cse10)))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~main__t~0 .cse12)) (fp.sub c_currentRoundingMode .cse2 .cse12))))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)))))) is different from true [2021-11-02 22:30:50,642 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= c_ULTIMATE.start_main_~main__z~0 (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2)))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)) .cse0) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2)))) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__z~0) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-02 22:31:03,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-02 22:31:03,983 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-02 22:31:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-02 22:31:03,985 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-02 22:31:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-02 22:31:03,986 INFO L225 Difference]: With dead ends: 35 [2021-11-02 22:31:03,986 INFO L226 Difference]: Without dead ends: 30 [2021-11-02 22:31:03,987 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 116.7s TimeCoverageRelationStatistics Valid=63, Invalid=73, Unknown=38, NotChecked=528, Total=702 [2021-11-02 22:31:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-02 22:31:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2021-11-02 22:31:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:31:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2021-11-02 22:31:03,992 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 13 [2021-11-02 22:31:03,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-02 22:31:03,993 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2021-11-02 22:31:03,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-02 22:31:03,993 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2021-11-02 22:31:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-02 22:31:03,994 INFO L505 BasicCegarLoop]: Found error trace [2021-11-02 22:31:03,994 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-02 22:31:04,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-02 22:31:04,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 [2021-11-02 22:31:04,197 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-02 22:31:04,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-02 22:31:04,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1710804433, now seen corresponding path program 1 times [2021-11-02 22:31:04,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-02 22:31:04,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776189342] [2021-11-02 22:31:04,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-02 22:31:04,199 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-02 22:31:04,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat [2021-11-02 22:31:04,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-02 22:31:04,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0bce546-c9a6-4d06-b18b-699bed68b7a9/bin/uautomizer-tBqnrhUYjU/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-02 22:31:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-02 22:31:05,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2021-11-02 22:31:05,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-02 22:31:12,654 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-02 22:31:12,655 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 266 treesize of output 146 [2021-11-02 22:32:13,403 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_15 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_15) ((_ extract 30 23) v_arrayElimCell_15) ((_ extract 22 0) v_arrayElimCell_15)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (exists ((v_arrayElimCell_14 (_ BitVec 32)) (v_arrayElimCell_13 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32)) (ULTIMATE.start_main_~main__t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_11 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_14) ((_ extract 30 23) v_arrayElimCell_14) ((_ extract 22 0) v_arrayElimCell_14))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_11) ((_ extract 30 23) v_arrayElimCell_11) ((_ extract 22 0) v_arrayElimCell_11))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_12) ((_ extract 30 23) v_arrayElimCell_12) ((_ extract 22 0) v_arrayElimCell_12))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_13) ((_ extract 30 23) v_arrayElimCell_13) ((_ extract 22 0) v_arrayElimCell_13)))) (and (= (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~main__t~0 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) c_ULTIMATE.start_main_~main__z~0) (fp.leq ULTIMATE.start_main_~main__t~0 .cse3) (fp.geq ULTIMATE.start_main_~main__t~0 .cse2) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false