./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/interpolation2.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_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:02:17,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:02:17,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:02:17,957 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:02:17,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:02:17,964 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:02:17,969 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:02:17,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:02:17,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:02:17,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:02:17,988 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:02:17,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:02:17,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:02:17,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:02:17,999 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:02:18,002 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:02:18,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:02:18,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:02:18,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:02:18,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:02:18,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:02:18,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:02:18,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:02:18,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:02:18,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:02:18,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:02:18,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:02:18,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:02:18,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:02:18,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:02:18,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:02:18,050 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:02:18,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:02:18,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:02:18,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:02:18,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:02:18,058 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:02:18,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:02:18,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:02:18,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:02:18,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:02:18,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 05:02:18,123 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:02:18,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:02:18,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:02:18,126 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:02:18,126 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:02:18,127 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:02:18,127 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:02:18,127 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:02:18,127 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:02:18,128 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:02:18,129 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:02:18,130 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:02:18,130 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:02:18,130 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:02:18,131 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:02:18,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:02:18,132 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:02:18,132 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:02:18,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:02:18,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:02:18,133 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:02:18,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:02:18,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:02:18,134 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:02:18,134 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:02:18,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:02:18,135 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:02:18,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:02:18,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:02:18,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:02:18,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:02:18,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:02:18,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:02:18,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:02:18,140 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:02:18,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:02:18,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:02:18,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:02:18,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:02:18,141 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/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_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2021-11-03 05:02:18,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:02:18,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:02:18,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:02:18,546 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:02:18,547 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:02:18,548 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-03 05:02:18,640 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data/1be31181e/04d8657cb705436f8440934889bc3041/FLAG3ff32027b [2021-11-03 05:02:19,280 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:02:19,283 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-03 05:02:19,298 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data/1be31181e/04d8657cb705436f8440934889bc3041/FLAG3ff32027b [2021-11-03 05:02:19,611 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data/1be31181e/04d8657cb705436f8440934889bc3041 [2021-11-03 05:02:19,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:02:19,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:02:19,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:02:19,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:02:19,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:02:19,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:02:19" (1/1) ... [2021-11-03 05:02:19,630 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c5f050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:19, skipping insertion in model container [2021-11-03 05:02:19,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:02:19" (1/1) ... [2021-11-03 05:02:19,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:02:19,658 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:02:19,917 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_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-03 05:02:19,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:02:19,979 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:02:19,997 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_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-03 05:02:20,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:02:20,033 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:02:20,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20 WrapperNode [2021-11-03 05:02:20,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:02:20,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:02:20,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:02:20,036 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:02:20,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,057 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:02:20,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:02:20,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:02:20,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:02:20,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:02:20,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:02:20,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:02:20,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:02:20,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (1/1) ... [2021-11-03 05:02:20,132 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:02:20,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:02:20,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:02:20,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:02:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:02:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:02:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-03 05:02:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:02:20,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:02:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-03 05:02:20,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:02:20,774 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:02:20,775 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-03 05:02:20,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:02:20 BoogieIcfgContainer [2021-11-03 05:02:20,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:02:20,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:02:20,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:02:20,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:02:20,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:02:19" (1/3) ... [2021-11-03 05:02:20,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b56b084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:02:20, skipping insertion in model container [2021-11-03 05:02:20,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:20" (2/3) ... [2021-11-03 05:02:20,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b56b084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:02:20, skipping insertion in model container [2021-11-03 05:02:20,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:02:20" (3/3) ... [2021-11-03 05:02:20,789 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2021-11-03 05:02:20,796 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:02:20,796 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 05:02:20,880 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:02:20,894 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:02:20,894 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 05:02:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:02:20,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 05:02:20,931 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:02:20,932 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 05:02:20,933 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:02:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:02:20,941 INFO L85 PathProgramCache]: Analyzing trace with hash 85773351, now seen corresponding path program 1 times [2021-11-03 05:02:20,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:02:20,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729917305] [2021-11-03 05:02:20,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:02:20,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:02:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:02:21,271 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-03 05:02:21,272 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:02:21,272 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729917305] [2021-11-03 05:02:21,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729917305] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:02:21,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:02:21,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:02:21,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225450811] [2021-11-03 05:02:21,281 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:02:21,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:02:21,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:02:21,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:02:21,326 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-03 05:02:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:02:21,358 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-03 05:02:21,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:02:21,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-11-03 05:02:21,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:02:21,371 INFO L225 Difference]: With dead ends: 23 [2021-11-03 05:02:21,371 INFO L226 Difference]: Without dead ends: 13 [2021-11-03 05:02:21,375 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:02:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-03 05:02:21,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2021-11-03 05:02:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 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-03 05:02:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-11-03 05:02:21,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2021-11-03 05:02:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:02:21,414 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-11-03 05:02:21,415 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-03 05:02:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-11-03 05:02:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:02:21,416 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:02:21,416 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:02:21,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:02:21,418 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:02:21,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:02:21,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1666710841, now seen corresponding path program 1 times [2021-11-03 05:02:21,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:02:21,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69189370] [2021-11-03 05:02:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:02:21,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:02:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 05:02:21,487 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 05:02:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 05:02:21,546 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 05:02:21,547 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 05:02:21,548 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 05:02:21,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:02:21,557 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-11-03 05:02:21,561 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 05:02:21,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 05:02:21 BoogieIcfgContainer [2021-11-03 05:02:21,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 05:02:21,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 05:02:21,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 05:02:21,597 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 05:02:21,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:02:20" (3/4) ... [2021-11-03 05:02:21,601 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-03 05:02:21,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 05:02:21,604 INFO L168 Benchmark]: Toolchain (without parser) took 1984.40 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 94.2 MB in the beginning and 112.5 MB in the end (delta: -18.4 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. [2021-11-03 05:02:21,605 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 123.7 MB. Free memory was 77.5 MB in the beginning and 77.4 MB in the end (delta: 58.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:02:21,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.71 ms. Allocated memory is still 123.7 MB. Free memory was 94.0 MB in the beginning and 96.8 MB in the end (delta: -2.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 05:02:21,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.11 ms. Allocated memory is still 123.7 MB. Free memory was 96.8 MB in the beginning and 95.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:02:21,614 INFO L168 Benchmark]: Boogie Preprocessor took 33.90 ms. Allocated memory is still 123.7 MB. Free memory was 95.0 MB in the beginning and 93.7 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:02:21,615 INFO L168 Benchmark]: RCFGBuilder took 656.71 ms. Allocated memory is still 123.7 MB. Free memory was 93.4 MB in the beginning and 76.2 MB in the end (delta: 17.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-11-03 05:02:21,616 INFO L168 Benchmark]: TraceAbstraction took 815.49 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 75.5 MB in the beginning and 112.5 MB in the end (delta: -37.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:02:21,616 INFO L168 Benchmark]: Witness Printer took 5.54 ms. Allocated memory is still 148.9 MB. Free memory is still 112.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:02:21,625 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.35 ms. Allocated memory is still 123.7 MB. Free memory was 77.5 MB in the beginning and 77.4 MB in the end (delta: 58.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 414.71 ms. Allocated memory is still 123.7 MB. Free memory was 94.0 MB in the beginning and 96.8 MB in the end (delta: -2.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.11 ms. Allocated memory is still 123.7 MB. Free memory was 96.8 MB in the beginning and 95.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.90 ms. Allocated memory is still 123.7 MB. Free memory was 95.0 MB in the beginning and 93.7 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 656.71 ms. Allocated memory is still 123.7 MB. Free memory was 93.4 MB in the beginning and 76.2 MB in the end (delta: 17.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 815.49 ms. Allocated memory was 123.7 MB in the beginning and 148.9 MB in the end (delta: 25.2 MB). Free memory was 75.5 MB in the beginning and 112.5 MB in the end (delta: -37.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 5.54 ms. Allocated memory is still 148.9 MB. Free memory is still 112.5 MB. 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: 9]: 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 28, overapproximation of to_real at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 26. Possible FailurePath: [L13] int i; [L14] float z, t; [L15] float min[] = { 5, 10, 12, 30, 150 }; [L16] float max[] = { 10, 12, 30, 150, 300 }; [L17] float org[] = { 1, 5, -10, 30, 20 }; [L18] float slope[] = { 4, -15, 40, -10, 0 }; [L20] t = __VERIFIER_nondet_float() [L21] EXPR min[0] [L21] t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L7] COND FALSE !(!cond) [L23] i = 0 [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) [L24] EXPR max[i] [L24] COND TRUE t <= max[i] [L26] EXPR org[i] [L26] EXPR slope[i] [L26] EXPR min[i] [L26] EXPR max[i] [L26] EXPR min[i] [L26] z = org[i] + slope[i] * (t - min[i]) / (max[i] - min[i]) [L9] COND TRUE !(cond) [L9] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 8 SDtfs, 7 SDslu, 6 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 3, 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, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 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-03 05:02:21,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:02:24,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:02:24,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:02:24,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:02:24,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:02:24,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:02:24,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:02:24,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:02:24,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:02:24,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:02:24,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:02:24,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:02:24,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:02:24,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:02:24,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:02:24,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:02:24,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:02:24,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:02:24,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:02:24,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:02:24,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:02:24,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:02:24,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:02:24,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:02:24,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:02:24,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:02:24,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:02:24,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:02:24,847 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:02:24,848 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:02:24,849 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:02:24,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:02:24,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:02:24,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:02:24,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:02:24,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:02:24,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:02:24,857 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:02:24,858 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:02:24,859 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:02:24,860 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:02:24,862 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-03 05:02:24,893 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:02:24,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:02:24,894 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:02:24,895 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:02:24,895 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:02:24,895 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:02:24,896 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:02:24,896 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:02:24,896 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:02:24,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:02:24,898 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:02:24,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:02:24,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:02:24,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 05:02:24,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:02:24,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 05:02:24,899 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:02:24,900 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-03 05:02:24,900 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-03 05:02:24,900 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:02:24,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 05:02:24,901 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:02:24,901 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 05:02:24,901 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:02:24,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-03 05:02:24,902 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:02:24,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:02:24,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:02:24,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:02:24,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 05:02:24,904 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-03 05:02:24,904 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-03 05:02:24,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 05:02:24,905 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:02:24,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:02:24,905 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_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/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_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2021-11-03 05:02:25,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:02:25,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:02:25,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:02:25,485 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:02:25,486 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:02:25,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-03 05:02:25,579 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data/3c973c48d/0d1bfaf8bab64adcb87e95b8d93adcb0/FLAG7686fd8a6 [2021-11-03 05:02:26,185 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:02:26,185 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-03 05:02:26,196 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data/3c973c48d/0d1bfaf8bab64adcb87e95b8d93adcb0/FLAG7686fd8a6 [2021-11-03 05:02:26,499 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/data/3c973c48d/0d1bfaf8bab64adcb87e95b8d93adcb0 [2021-11-03 05:02:26,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:02:26,510 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:02:26,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:02:26,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:02:26,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:02:26,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:26,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bf9551b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26, skipping insertion in model container [2021-11-03 05:02:26,521 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:26,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:02:26,545 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:02:26,719 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_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-03 05:02:26,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:02:26,821 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:02:26,838 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_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-03 05:02:26,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:02:26,892 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:02:26,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26 WrapperNode [2021-11-03 05:02:26,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:02:26,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:02:26,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:02:26,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:02:26,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:26,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:26,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:02:26,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:02:26,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:02:26,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:02:26,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:26,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:26,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:26,985 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:26,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:27,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:27,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:27,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:02:27,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:02:27,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:02:27,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:02:27,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (1/1) ... [2021-11-03 05:02:27,027 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:02:27,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:02:27,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:02:27,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:02:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-03 05:02:27,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-03 05:02:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:02:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-03 05:02:27,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:02:27,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:02:27,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:02:29,798 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:02:29,799 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-03 05:02:29,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:02:29 BoogieIcfgContainer [2021-11-03 05:02:29,801 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:02:29,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:02:29,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:02:29,807 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:02:29,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:02:26" (1/3) ... [2021-11-03 05:02:29,808 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0bf52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:02:29, skipping insertion in model container [2021-11-03 05:02:29,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:02:26" (2/3) ... [2021-11-03 05:02:29,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0bf52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:02:29, skipping insertion in model container [2021-11-03 05:02:29,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:02:29" (3/3) ... [2021-11-03 05:02:29,811 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2021-11-03 05:02:29,817 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:02:29,818 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 05:02:29,868 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:02:29,875 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:02:29,875 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 05:02:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 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-03 05:02:29,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:02:29,895 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:02:29,896 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:02:29,897 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:02:29,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:02:29,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-11-03 05:02:29,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:02:29,917 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2002099881] [2021-11-03 05:02:29,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:02:29,918 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:02:29,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:02:29,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:02:29,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-03 05:02:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:02:30,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-03 05:02:30,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:02:30,524 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-03 05:02:30,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:02:30,602 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-03 05:02:30,603 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 05:02:30,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2002099881] [2021-11-03 05:02:30,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2002099881] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:02:30,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:02:30,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-03 05:02:30,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310381743] [2021-11-03 05:02:30,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-03 05:02:30,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 05:02:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-03 05:02:30,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 05:02:30,646 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:02:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:02:30,664 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-03 05:02:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-03 05:02:30,665 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-03 05:02:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:02:30,675 INFO L225 Difference]: With dead ends: 29 [2021-11-03 05:02:30,675 INFO L226 Difference]: Without dead ends: 13 [2021-11-03 05:02:30,679 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-03 05:02:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-03 05:02:30,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-03 05:02:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:02:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-03 05:02:30,716 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-03 05:02:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:02:30,717 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-03 05:02:30,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:02:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-03 05:02:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-03 05:02:30,720 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:02:30,720 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:02:30,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-03 05:02:30,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 05:02:30,934 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:02:30,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:02:30,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-11-03 05:02:30,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:02:30,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146668874] [2021-11-03 05:02:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:02:30,937 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:02:30,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:02:30,962 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:02:30,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-03 05:02:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:02:31,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-03 05:02:31,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:02:31,648 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-03 05:02:31,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:02:31,717 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-03 05:02:31,717 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 05:02:31,718 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146668874] [2021-11-03 05:02:31,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146668874] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:02:31,718 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:02:31,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-03 05:02:31,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088839578] [2021-11-03 05:02:31,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:02:31,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 05:02:31,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:02:31,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:02:31,723 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:02:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:02:34,182 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-03 05:02:34,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:02:34,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-03 05:02:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:02:34,184 INFO L225 Difference]: With dead ends: 23 [2021-11-03 05:02:34,184 INFO L226 Difference]: Without dead ends: 19 [2021-11-03 05:02:34,185 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:02:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-03 05:02:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-03 05:02:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:02:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-03 05:02:34,190 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2021-11-03 05:02:34,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:02:34,191 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-03 05:02:34,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:02:34,191 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-03 05:02:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 05:02:34,192 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:02:34,192 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:02:34,219 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-03 05:02:34,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 [2021-11-03 05:02:34,394 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 05:02:34,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:02:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-11-03 05:02:34,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-03 05:02:34,396 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887795586] [2021-11-03 05:02:34,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:02:34,396 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-03 05:02:34,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat [2021-11-03 05:02:34,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-03 05:02:34,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b85449b8-13f5-4d0e-8b5f-a6bfd3a1c075/bin/utaipan-aC7eJsxGYH/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-03 05:02:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:02:35,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-03 05:02:35,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-03 05:02:44,516 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-03 05:02:44,517 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 612 treesize of output 312 [2021-11-03 05:09:14,079 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.leq ULTIMATE.start_main_~t~0 .cse0) (let ((.cse1 (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse4)) (fp.sub roundNearestTiesToEven .cse0 .cse4))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0)))) (or (and (not .cse1) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))))) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq ULTIMATE.start_main_~t~0 .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse3)))) is different from false [2021-11-03 05:09:16,111 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.leq ULTIMATE.start_main_~t~0 .cse0) (let ((.cse1 (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse4)) (fp.sub roundNearestTiesToEven .cse0 .cse4))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0)))) (or (and (not .cse1) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))))) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq ULTIMATE.start_main_~t~0 .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse3)))) is different from true [2021-11-03 05:10:39,163 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.leq ULTIMATE.start_main_~t~0 .cse0) (not (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq ULTIMATE.start_main_~t~0 .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2)))) is different from false [2021-11-03 05:10:41,194 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.leq ULTIMATE.start_main_~t~0 .cse0) (not (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse3)) (fp.sub roundNearestTiesToEven .cse0 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq ULTIMATE.start_main_~t~0 .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2)))) is different from true [2021-11-03 05:10:41,196 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-03 05:10:41,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-03 05:10:52,117 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) (bvadd |c_ULTIMATE.start_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_~t~0 .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) is different from false [2021-11-03 05:10:54,213 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) (bvadd |c_ULTIMATE.start_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_~t~0 .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) is different from true [2021-11-03 05:11:09,347 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) (bvadd |c_ULTIMATE.start_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_~t~0 .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|))) is different from false [2021-11-03 05:11:11,449 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (let ((.cse2 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) (bvadd |c_ULTIMATE.start_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_~t~0 .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) .cse4))))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|))) is different from true [2021-11-03 05:11:26,545 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) (bvadd |c_ULTIMATE.start_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_~t~0 .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse5))))) is different from false [2021-11-03 05:11:28,641 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse2)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) (bvadd |c_ULTIMATE.start_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_~t~0 .cse4)) (fp.sub c_currentRoundingMode .cse5 .cse4)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse5))))) is different from true [2021-11-03 05:11:43,722 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (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_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4)))) is different from false [2021-11-03 05:11:45,818 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (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_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4)))) is different from true [2021-11-03 05:12:05,250 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (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_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4)))) is different from false [2021-11-03 05:12:07,341 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (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_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4)))) is different from true [2021-11-03 05:12:26,819 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (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_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4)))) is different from false [2021-11-03 05:12:28,918 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|) |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (let ((.cse0 (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (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_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse3)) (fp.sub c_currentRoundingMode .cse4 .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse4)))) is different from true [2021-11-03 05:12:52,679 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse6 (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (let ((.cse2 (fp.add c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse5)) (fp.sub c_currentRoundingMode .cse6 .cse5)))))) (and (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse6))))) is different from false [2021-11-03 05:12:54,774 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse6 (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (let ((.cse2 (fp.add c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (let ((.cse5 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse5)) (fp.sub c_currentRoundingMode .cse6 .cse5)))))) (and (fp.leq .cse2 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not |c_ULTIMATE.start_main_#t~short10|) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse6))))) is different from true [2021-11-03 05:14:27,177 WARN L207 SmtUtils]: Spent 1.54 m on a formula simplification. DAG size of input: 33 DAG size of output: 11 [2021-11-03 05:14:27,179 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-03 05:14:27,179 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 409 treesize of output 211 [2021-11-03 05:16:14,873 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse2)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse3)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))))))) (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from false [2021-11-03 05:16:16,958 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse2)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse3)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))))))) (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:16:16,959 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-03 05:16:16,960 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-03 05:16:16,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887795586] [2021-11-03 05:16:16,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887795586] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-03 05:16:16,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:16:16,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2021-11-03 05:16:16,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139082672] [2021-11-03 05:16:16,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-03 05:16:16,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-03 05:16:16,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-03 05:16:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=79, Unknown=20, NotChecked=270, Total=420 [2021-11-03 05:16:16,964 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 21 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 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-03 05:16:19,088 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse2)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse3)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))))))) (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-03 05:16:21,172 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_7 (_ BitVec 32)) (v_ULTIMATE.start_main_~t~0_10 (_ FloatingPoint 8 24))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~t~0_10 .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (not (fp.geq v_ULTIMATE.start_main_~t~0_10 .cse2)) (not (fp.leq v_ULTIMATE.start_main_~t~0_10 .cse3)) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))))))) (forall ((v_arrayElimCell_6 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-03 05:16:24,497 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse0 (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse5 (let ((.cse12 (select .cse9 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse4 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse6 (not |c_ULTIMATE.start_main_#t~short10|)) (.cse1 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (let ((.cse8 (select .cse9 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (or (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2)) (let ((.cse3 (fp.add c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1)) (fp.sub c_currentRoundingMode .cse5 .cse1))))) (and (fp.leq .cse3 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse3 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) .cse6 (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse5))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (let ((.cse7 (fp.geq c_ULTIMATE.start_main_~t~0 .cse1))) (or (and |c_ULTIMATE.start_main_#t~short10| .cse7) (and (not .cse7) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:16:26,539 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse3 (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse1 (not |c_ULTIMATE.start_main_#t~short10|)) (.cse7 (let ((.cse12 (select .cse9 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse6 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse4 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (let ((.cse8 (select .cse9 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~t~0 .cse2))) (or (and (not .cse0) .cse1) (and |c_ULTIMATE.start_main_#t~short10| .cse0))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (or (let ((.cse5 (fp.add c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse4)) (fp.sub c_currentRoundingMode .cse7 .cse4))))) (and (fp.leq .cse5 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse5 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) .cse1 (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse7))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse4) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from false [2021-11-03 05:16:28,623 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse3 (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse1 (not |c_ULTIMATE.start_main_#t~short10|)) (.cse7 (let ((.cse12 (select .cse9 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse6 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse4 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (let ((.cse8 (select .cse9 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~t~0 .cse2))) (or (and (not .cse0) .cse1) (and |c_ULTIMATE.start_main_#t~short10| .cse0))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (or (let ((.cse5 (fp.add c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse4)) (fp.sub c_currentRoundingMode .cse7 .cse4))))) (and (fp.leq .cse5 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse5 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) .cse1 (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse7))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse4) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:16:31,269 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse3 (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse1 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse7 (let ((.cse12 (select .cse9 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse5 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse6 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (let ((.cse8 (select .cse9 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~t~0 .cse2))) (or (and (not .cse0) .cse1) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse0))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (or (let ((.cse4 (fp.add c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse6)) (fp.sub c_currentRoundingMode .cse7 .cse6))))) (and (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse4 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) .cse1 (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse7))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse6) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:16:33,309 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse3 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse1 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (or (let ((.cse4 (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1)) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse4 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~t~0 .cse5) (fp.geq c_ULTIMATE.start_main_~t~0 .cse1) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from false [2021-11-03 05:16:35,401 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|))) (let ((.cse3 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|) |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (let ((.cse10 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|) |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse2 (let ((.cse9 (select .cse7 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse1 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|) |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (.cse5 (let ((.cse6 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (or (let ((.cse4 (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse1)) (fp.sub c_currentRoundingMode .cse2 .cse1))))) (and (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse4 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse2))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~t~0 .cse5) (fp.geq c_ULTIMATE.start_main_~t~0 .cse1) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:16:37,441 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|)) (.cse2 (let ((.cse18 (select .cse14 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse16 (let ((.cse17 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17))))) (and (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (let ((.cse9 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse12 (let ((.cse15 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (or (let ((.cse7 (fp.add c_currentRoundingMode (let ((.cse8 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) (let ((.cse11 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse10 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#slope~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse11)) (fp.sub c_currentRoundingMode .cse12 .cse11)))))) (and (fp.leq .cse7 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse7 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse12))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~t~0 .cse16) (fp.geq c_ULTIMATE.start_main_~t~0 .cse2) (= .cse16 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from false [2021-11-03 05:16:39,527 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|))) (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|)) (.cse2 (let ((.cse18 (select .cse14 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse16 (let ((.cse17 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17))))) (and (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (let ((.cse9 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse12 (let ((.cse15 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))))) (or (let ((.cse7 (fp.add c_currentRoundingMode (let ((.cse8 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) (let ((.cse11 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse10 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#slope~0.offset| .cse9)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse11)) (fp.sub c_currentRoundingMode .cse12 .cse11)))))) (and (fp.leq .cse7 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse7 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 .cse12))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~t~0 .cse16) (fp.geq c_ULTIMATE.start_main_~t~0 .cse2) (= .cse16 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))))) is different from true [2021-11-03 05:16:41,593 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|))) (let ((.cse3 (let ((.cse18 (select .cse15 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse8 (let ((.cse17 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|)) (.cse0 (let ((.cse16 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (and (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem12| .cse0) (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= (let ((.cse4 (select .cse5 |c_ULTIMATE.start_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))) (= (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~t~0 .cse8) (fp.geq c_ULTIMATE.start_main_~t~0 .cse3) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (or (let ((.cse9 (fp.add c_currentRoundingMode (let ((.cse10 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) (let ((.cse13 (let ((.cse14 (select .cse15 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse12 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#slope~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse13)) (fp.sub c_currentRoundingMode .cse0 .cse13)))))) (and (fp.leq .cse9 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse9 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)))))) is different from false [2021-11-03 05:16:43,678 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse11 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32))) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|))) (let ((.cse3 (let ((.cse18 (select .cse15 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse8 (let ((.cse17 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|)) (.cse0 (let ((.cse16 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))))) (and (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem12| .cse0) (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= (let ((.cse4 (select .cse5 |c_ULTIMATE.start_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))) (= (let ((.cse6 (select .cse7 |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~t~0 .cse8) (fp.geq c_ULTIMATE.start_main_~t~0 .cse3) (= .cse8 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (or (let ((.cse9 (fp.add c_currentRoundingMode (let ((.cse10 (select .cse7 (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) (let ((.cse13 (let ((.cse14 (select .cse15 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse12 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#slope~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse13)) (fp.sub c_currentRoundingMode .cse0 .cse13)))))) (and (fp.leq .cse9 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse9 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))) (not (fp.leq c_ULTIMATE.start_main_~t~0 |c_ULTIMATE.start_main_#t~mem12|)))))) is different from true [2021-11-03 05:16:45,792 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse11 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|)) (.cse3 (let ((.cse17 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|))) (let ((.cse4 (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse0 (fp.add c_currentRoundingMode (let ((.cse10 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) (let ((.cse13 (let ((.cse14 (select .cse15 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse12 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#slope~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse13)) (fp.sub c_currentRoundingMode .cse3 .cse13)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.leq c_ULTIMATE.start_main_~t~0 .cse3) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse4) (= (let ((.cse9 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from false [2021-11-03 05:16:47,882 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0.base|)) (.cse11 (bvmul c_ULTIMATE.start_main_~i~0 (_ bv4 32)))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0.base|)) (.cse3 (let ((.cse17 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse15 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0.base|))) (let ((.cse4 (let ((.cse16 (select .cse15 |c_ULTIMATE.start_main_~#min~0.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse0 (fp.add c_currentRoundingMode (let ((.cse10 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#org~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) (let ((.cse13 (let ((.cse14 (select .cse15 (bvadd |c_ULTIMATE.start_main_~#min~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse12 (select .cse2 (bvadd |c_ULTIMATE.start_main_~#slope~0.offset| .cse11)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~t~0 .cse13)) (fp.sub c_currentRoundingMode .cse3 .cse13)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (= c_ULTIMATE.start_main_~i~0 (_ bv0 32)) (= (_ bv0 32) |c_ULTIMATE.start_main_~#org~0.offset|) (= |c_ULTIMATE.start_main_~#min~0.offset| (_ bv0 32)) (= (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~#slope~0.offset|))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32))) (fp.leq c_ULTIMATE.start_main_~t~0 .cse3) (= |c_ULTIMATE.start_main_~#max~0.offset| (_ bv0 32)) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= |c_ULTIMATE.start_main_~#slope~0.offset| (_ bv0 32)) (= (let ((.cse5 (select .cse6 |c_ULTIMATE.start_main_~#max~0.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= (let ((.cse7 (select .cse8 |c_ULTIMATE.start_main_~#org~0.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~t~0 .cse4) (= (let ((.cse9 (select .cse6 (bvadd |c_ULTIMATE.start_main_~#max~0.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.geq .cse0 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from true [2021-11-03 05:16:49,976 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (exists ((ULTIMATE.start_main_~t~0 (_ FloatingPoint 8 24)) (v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse4 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.leq ULTIMATE.start_main_~t~0 .cse0) (let ((.cse1 (fp.leq (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~t~0 .cse4)) (fp.sub roundNearestTiesToEven .cse0 .cse4))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0)))) (or (and (not .cse1) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32))))) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq ULTIMATE.start_main_~t~0 .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse3))))) is different from false