./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:29:03,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:29:03,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:29:03,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:29:03,693 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:29:03,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:29:03,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:29:03,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:29:03,707 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:29:03,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:29:03,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:29:03,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:29:03,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:29:03,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:29:03,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:29:03,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:29:03,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:29:03,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:29:03,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:29:03,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:29:03,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:29:03,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:29:03,731 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:29:03,732 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:29:03,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:29:03,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:29:03,737 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:29:03,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:29:03,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:29:03,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:29:03,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:29:03,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:29:03,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:29:03,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:29:03,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:29:03,745 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:29:03,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:29:03,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:29:03,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:29:03,748 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:29:03,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:29:03,750 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 07:29:03,786 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:29:03,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:29:03,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:29:03,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:29:03,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:29:03,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:29:03,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:29:03,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:29:03,790 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:29:03,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:29:03,791 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:29:03,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 07:29:03,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:29:03,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:29:03,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:29:03,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:29:03,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:29:03,793 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:29:03,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:29:03,794 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:29:03,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:29:03,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:29:03,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:29:03,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:29:03,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:29:03,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:29:03,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:29:03,801 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:29:03,802 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 07:29:03,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 07:29:03,804 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:29:03,804 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:29:03,804 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:29:03,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:29:03,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/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_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2021-11-20 07:29:04,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:29:04,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:29:04,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:29:04,081 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:29:04,085 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:29:04,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-20 07:29:04,164 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data/449907829/e60b69691a4b46efaa8de227c043a760/FLAGa5877c8a6 [2021-11-20 07:29:04,568 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:29:04,568 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-20 07:29:04,574 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data/449907829/e60b69691a4b46efaa8de227c043a760/FLAGa5877c8a6 [2021-11-20 07:29:04,968 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data/449907829/e60b69691a4b46efaa8de227c043a760 [2021-11-20 07:29:04,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:29:04,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:29:04,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:29:04,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:29:04,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:29:04,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:29:04" (1/1) ... [2021-11-20 07:29:04,985 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b9af92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:04, skipping insertion in model container [2021-11-20 07:29:04,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:29:04" (1/1) ... [2021-11-20 07:29:04,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:29:05,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:29:05,168 WARN L230 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_35960a89-cac6-44d2-85e9-068c8b4ac8cb/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-20 07:29:05,193 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:29:05,200 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:29:05,213 WARN L230 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_35960a89-cac6-44d2-85e9-068c8b4ac8cb/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-20 07:29:05,230 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:29:05,247 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:29:05,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05 WrapperNode [2021-11-20 07:29:05,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:29:05,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:29:05,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:29:05,249 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:29:05,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,266 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,306 INFO L137 Inliner]: procedures = 18, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2021-11-20 07:29:05,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:29:05,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:29:05,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:29:05,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:29:05,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,334 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,369 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:29:05,370 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:29:05,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:29:05,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:29:05,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (1/1) ... [2021-11-20 07:29:05,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:29:05,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:29:05,417 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:29:05,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:29:05,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:29:05,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 07:29:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 07:29:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-11-20 07:29:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:29:05,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:29:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-11-20 07:29:05,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:29:05,567 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:29:05,569 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:29:05,707 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:29:05,713 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:29:05,713 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 07:29:05,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:29:05 BoogieIcfgContainer [2021-11-20 07:29:05,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:29:05,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:29:05,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:29:05,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:29:05,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:29:04" (1/3) ... [2021-11-20 07:29:05,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c0afbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:29:05, skipping insertion in model container [2021-11-20 07:29:05,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:05" (2/3) ... [2021-11-20 07:29:05,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c0afbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:29:05, skipping insertion in model container [2021-11-20 07:29:05,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:29:05" (3/3) ... [2021-11-20 07:29:05,723 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2021-11-20 07:29:05,728 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:29:05,728 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 07:29:05,777 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:29:05,785 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:29:05,785 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 07:29:05,800 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-20 07:29:05,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-20 07:29:05,805 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:29:05,806 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:29:05,807 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:29:05,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:29:05,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-11-20 07:29:05,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:29:05,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567884514] [2021-11-20 07:29:05,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:05,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:29:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:06,052 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-20 07:29:06,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:29:06,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567884514] [2021-11-20 07:29:06,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567884514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:29:06,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:29:06,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 07:29:06,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256767936] [2021-11-20 07:29:06,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:29:06,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 07:29:06,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:29:06,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 07:29:06,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 07:29:06,123 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-20 07:29:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:29:06,143 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-20 07:29:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 07:29:06,147 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-20 07:29:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:29:06,156 INFO L225 Difference]: With dead ends: 29 [2021-11-20 07:29:06,156 INFO L226 Difference]: Without dead ends: 13 [2021-11-20 07:29:06,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-20 07:29:06,167 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:29:06,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:29:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-20 07:29:06,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-20 07:29:06,204 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-20 07:29:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-20 07:29:06,206 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-20 07:29:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:29:06,207 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-20 07:29:06,207 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-20 07:29:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-20 07:29:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-20 07:29:06,208 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:29:06,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:29:06,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 07:29:06,210 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:29:06,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:29:06,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-11-20 07:29:06,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:29:06,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241573621] [2021-11-20 07:29:06,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:06,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:29:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:06,348 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-20 07:29:06,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 07:29:06,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241573621] [2021-11-20 07:29:06,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241573621] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 07:29:06,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:29:06,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 07:29:06,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819463146] [2021-11-20 07:29:06,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 07:29:06,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 07:29:06,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 07:29:06,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 07:29:06,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 07:29:06,358 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-20 07:29:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:29:06,388 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2021-11-20 07:29:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 07:29:06,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-20 07:29:06,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:29:06,396 INFO L225 Difference]: With dead ends: 24 [2021-11-20 07:29:06,396 INFO L226 Difference]: Without dead ends: 20 [2021-11-20 07:29:06,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-20 07:29:06,398 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:29:06,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:29:06,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-11-20 07:29:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2021-11-20 07:29:06,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-20 07:29:06,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-20 07:29:06,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2021-11-20 07:29:06,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:29:06,408 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-20 07:29:06,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-20 07:29:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-20 07:29:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 07:29:06,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:29:06,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:29:06,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 07:29:06,412 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:29:06,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:29:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-11-20 07:29:06,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 07:29:06,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642201859] [2021-11-20 07:29:06,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:06,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 07:29:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:29:06,463 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 07:29:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 07:29:06,535 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 07:29:06,536 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 07:29:06,537 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 07:29:06,539 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 07:29:06,542 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-20 07:29:06,545 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 07:29:06,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:29:06 BoogieIcfgContainer [2021-11-20 07:29:06,576 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 07:29:06,577 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 07:29:06,577 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 07:29:06,578 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 07:29:06,578 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:29:05" (3/4) ... [2021-11-20 07:29:06,581 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-20 07:29:06,582 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 07:29:06,583 INFO L158 Benchmark]: Toolchain (without parser) took 1610.39ms. Allocated memory is still 117.4MB. Free memory was 82.1MB in the beginning and 46.4MB in the end (delta: 35.8MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2021-11-20 07:29:06,584 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 93.6MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:29:06,585 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.23ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 91.8MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-20 07:29:06,585 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.65ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 07:29:06,586 INFO L158 Benchmark]: Boogie Preprocessor took 61.85ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 88.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:29:06,586 INFO L158 Benchmark]: RCFGBuilder took 344.86ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 77.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-20 07:29:06,589 INFO L158 Benchmark]: TraceAbstraction took 859.98ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 46.4MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2021-11-20 07:29:06,589 INFO L158 Benchmark]: Witness Printer took 5.20ms. Allocated memory is still 117.4MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 07:29:06,592 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.31ms. Allocated memory is still 117.4MB. Free memory was 93.6MB in the beginning and 93.6MB in the end (delta: 23.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.23ms. Allocated memory is still 117.4MB. Free memory was 81.8MB in the beginning and 91.8MB in the end (delta: -9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.65ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 89.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.85ms. Allocated memory is still 117.4MB. Free memory was 89.7MB in the beginning and 88.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 344.86ms. Allocated memory is still 117.4MB. Free memory was 88.3MB in the beginning and 77.1MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 859.98ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 46.4MB in the end (delta: 30.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 5.20ms. Allocated memory is still 117.4MB. Free memory is still 46.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of 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] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR max[sizeof(max) / sizeof(max[0]) - 1] [L21] EXPR t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1] VAL [max={7:0}, max[sizeof(max) / sizeof(max[0]) - 1]=51, min={5:0}, min[0]=50, org={4:0}, slope={6:0}] [L21] CALL assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L7] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L21] RET assume_abort_if_not(t >= min[0] && t <= max[sizeof(max) / sizeof(max[0]) - 1]) [L23] i = 0 VAL [i=0, max={7:0}, min={5:0}, org={4:0}, slope={6:0}] [L23] COND TRUE i < sizeof(min) / sizeof(min[0]) [L24] EXPR max[i] VAL [i=0, max={7:0}, max[i]=49, min={5:0}, org={4:0}, slope={6:0}] [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]) [L28] CALL __VERIFIER_assert(z >= -10.f && z <= 30.f) [L9] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-20 07:29:06,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/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_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/interpolation2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 07:29:09,094 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 07:29:09,097 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 07:29:09,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 07:29:09,156 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 07:29:09,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 07:29:09,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 07:29:09,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 07:29:09,174 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 07:29:09,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 07:29:09,182 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 07:29:09,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 07:29:09,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 07:29:09,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 07:29:09,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 07:29:09,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 07:29:09,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 07:29:09,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 07:29:09,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 07:29:09,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 07:29:09,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 07:29:09,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 07:29:09,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 07:29:09,216 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 07:29:09,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 07:29:09,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 07:29:09,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 07:29:09,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 07:29:09,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 07:29:09,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 07:29:09,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 07:29:09,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 07:29:09,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 07:29:09,234 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 07:29:09,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 07:29:09,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 07:29:09,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 07:29:09,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 07:29:09,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 07:29:09,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 07:29:09,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 07:29:09,255 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-20 07:29:09,299 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 07:29:09,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 07:29:09,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 07:29:09,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 07:29:09,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 07:29:09,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 07:29:09,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 07:29:09,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 07:29:09,305 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 07:29:09,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 07:29:09,306 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 07:29:09,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 07:29:09,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 07:29:09,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 07:29:09,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 07:29:09,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 07:29:09,312 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 07:29:09,312 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 07:29:09,312 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 07:29:09,312 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 07:29:09,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 07:29:09,313 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 07:29:09,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 07:29:09,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 07:29:09,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 07:29:09,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 07:29:09,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:29:09,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 07:29:09,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 07:29:09,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 07:29:09,316 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-20 07:29:09,316 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 07:29:09,316 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 07:29:09,316 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 07:29:09,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 07:29:09,317 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 07:29:09,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 07:29:09,318 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_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/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_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5f3bcf3c30f63fe0ad0702712c01ba8d1145d6fb2558cd3e5ee3c870476dc3b1 [2021-11-20 07:29:09,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 07:29:09,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 07:29:09,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 07:29:09,742 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 07:29:09,743 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 07:29:09,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-20 07:29:09,825 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data/300f5619e/ec5aaebe3f674c909690fefe869ea1b3/FLAG526d4c3e4 [2021-11-20 07:29:10,419 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 07:29:10,420 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/sv-benchmarks/c/float-benchs/interpolation2.c [2021-11-20 07:29:10,427 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data/300f5619e/ec5aaebe3f674c909690fefe869ea1b3/FLAG526d4c3e4 [2021-11-20 07:29:10,771 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/data/300f5619e/ec5aaebe3f674c909690fefe869ea1b3 [2021-11-20 07:29:10,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 07:29:10,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 07:29:10,795 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 07:29:10,796 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 07:29:10,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 07:29:10,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:29:10" (1/1) ... [2021-11-20 07:29:10,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3728d26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:10, skipping insertion in model container [2021-11-20 07:29:10,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:29:10" (1/1) ... [2021-11-20 07:29:10,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 07:29:10,822 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 07:29:10,965 WARN L230 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_35960a89-cac6-44d2-85e9-068c8b4ac8cb/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-20 07:29:10,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:29:11,002 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 07:29:11,048 WARN L230 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_35960a89-cac6-44d2-85e9-068c8b4ac8cb/sv-benchmarks/c/float-benchs/interpolation2.c[450,463] [2021-11-20 07:29:11,084 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 07:29:11,103 INFO L208 MainTranslator]: Completed translation [2021-11-20 07:29:11,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11 WrapperNode [2021-11-20 07:29:11,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 07:29:11,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 07:29:11,106 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 07:29:11,106 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 07:29:11,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,171 INFO L137 Inliner]: procedures = 19, calls = 49, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2021-11-20 07:29:11,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 07:29:11,172 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 07:29:11,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 07:29:11,173 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 07:29:11,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 07:29:11,246 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 07:29:11,246 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 07:29:11,246 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 07:29:11,247 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (1/1) ... [2021-11-20 07:29:11,255 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 07:29:11,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 07:29:11,285 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 07:29:11,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 07:29:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 07:29:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-11-20 07:29:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-20 07:29:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-20 07:29:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-11-20 07:29:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 07:29:11,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 07:29:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 07:29:11,456 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 07:29:11,458 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 07:29:13,888 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 07:29:13,895 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 07:29:13,895 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 07:29:13,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:29:13 BoogieIcfgContainer [2021-11-20 07:29:13,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 07:29:13,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 07:29:13,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 07:29:13,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 07:29:13,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:29:10" (1/3) ... [2021-11-20 07:29:13,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b827e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:29:13, skipping insertion in model container [2021-11-20 07:29:13,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:29:11" (2/3) ... [2021-11-20 07:29:13,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b827e30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:29:13, skipping insertion in model container [2021-11-20 07:29:13,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:29:13" (3/3) ... [2021-11-20 07:29:13,905 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation2.c [2021-11-20 07:29:13,911 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 07:29:13,911 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 07:29:13,959 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 07:29:13,967 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 07:29:13,967 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 07:29:13,980 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-20 07:29:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-20 07:29:13,985 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:29:13,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:29:13,987 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:29:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:29:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1235833265, now seen corresponding path program 1 times [2021-11-20 07:29:14,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:29:14,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128477432] [2021-11-20 07:29:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:14,006 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:29:14,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:29:14,013 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:29:14,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 07:29:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:14,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-20 07:29:14,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:29:14,562 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-20 07:29:14,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:29:14,606 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-20 07:29:14,607 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:29:14,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128477432] [2021-11-20 07:29:14,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128477432] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 07:29:14,609 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:29:14,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-20 07:29:14,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036233888] [2021-11-20 07:29:14,611 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 07:29:14,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 07:29:14,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:29:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 07:29:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 07:29:14,664 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-20 07:29:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:29:14,678 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2021-11-20 07:29:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 07:29:14,680 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-20 07:29:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:29:14,687 INFO L225 Difference]: With dead ends: 29 [2021-11-20 07:29:14,687 INFO L226 Difference]: Without dead ends: 13 [2021-11-20 07:29:14,690 INFO L932 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-20 07:29:14,694 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 07:29:14,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 07:29:14,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-20 07:29:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-20 07:29:14,724 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-20 07:29:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-20 07:29:14,726 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2021-11-20 07:29:14,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:29:14,726 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-20 07:29:14,726 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-20 07:29:14,726 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-20 07:29:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-20 07:29:14,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:29:14,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:29:14,752 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 07:29:14,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 07:29:14,943 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:29:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:29:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1178902664, now seen corresponding path program 1 times [2021-11-20 07:29:14,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:29:14,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043198992] [2021-11-20 07:29:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:14,946 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:29:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:29:14,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:29:14,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 07:29:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:15,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 07:29:15,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:29:15,436 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-20 07:29:15,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:29:15,509 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-20 07:29:15,509 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:29:15,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043198992] [2021-11-20 07:29:15,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043198992] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 07:29:15,510 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:29:15,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-20 07:29:15,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795549418] [2021-11-20 07:29:15,510 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 07:29:15,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 07:29:15,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:29:15,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 07:29:15,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 07:29:15,513 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-20 07:29:17,789 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-11-20 07:29:17,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 07:29:17,894 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2021-11-20 07:29:17,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 07:29:17,895 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-20 07:29:17,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 07:29:17,896 INFO L225 Difference]: With dead ends: 23 [2021-11-20 07:29:17,896 INFO L226 Difference]: Without dead ends: 19 [2021-11-20 07:29:17,897 INFO L932 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-20 07:29:17,899 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-11-20 07:29:17,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2021-11-20 07:29:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-11-20 07:29:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2021-11-20 07:29:17,905 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-20 07:29:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2021-11-20 07:29:17,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2021-11-20 07:29:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 07:29:17,906 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-11-20 07:29:17,907 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-20 07:29:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2021-11-20 07:29:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 07:29:17,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 07:29:17,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 07:29:17,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-20 07:29:18,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 07:29:18,123 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 07:29:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 07:29:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 2110328889, now seen corresponding path program 1 times [2021-11-20 07:29:18,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 07:29:18,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578978951] [2021-11-20 07:29:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 07:29:18,125 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 07:29:18,125 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 07:29:18,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 07:29:18,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_35960a89-cac6-44d2-85e9-068c8b4ac8cb/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 07:29:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 07:29:18,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 30 conjunts are in the unsatisfiable core [2021-11-20 07:29:18,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 07:29:25,899 INFO L354 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2021-11-20 07:29:25,901 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-20 07:36:07,368 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse3 (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))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (let ((.cse0 (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse4 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse4) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse3) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2)))) is different from false [2021-11-20 07:36:09,397 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5))) (.cse3 (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))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (let ((.cse0 (fp.leq (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse3)) (fp.sub roundNearestTiesToEven .cse4 .cse3))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse4) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse3) (= .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse4) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse2)))) is different from true [2021-11-20 07:37:33,683 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ 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))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse3) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1)))) is different from false [2021-11-20 07:37:35,716 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32)) (|ULTIMATE.start_main_~t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_2 (_ 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))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_2) ((_ extract 30 23) v_arrayElimCell_2) ((_ extract 22 0) v_arrayElimCell_2)))) (and (not (fp.leq (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~t~0#1| .cse2)) (fp.sub roundNearestTiesToEven .cse3 .cse2))) ((_ to_fp 8 24) roundNearestTiesToEven 30.0))) (fp.leq |ULTIMATE.start_main_~t~0#1| .cse3) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (fp.geq |ULTIMATE.start_main_~t~0#1| .cse2) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse3) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4 32)) .cse1)))) is different from true [2021-11-20 07:37:35,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-20 07:37:35,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 07:37:46,619 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.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#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.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#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.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#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.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-20 07:37:48,714 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.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#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.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#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.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#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.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-20 07:38:03,842 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse0 (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.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#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.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#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.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#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.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-20 07:38:05,943 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse0 (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (fp.add c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.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#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.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#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.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#1| .cse4)) (fp.sub c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.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-20 07:38:21,071 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))))) is different from false [2021-11-20 07:38:23,163 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .cse5)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))))) is different from true [2021-11-20 07:38:38,284 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from false [2021-11-20 07:38:40,378 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from true [2021-11-20 07:38:59,883 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from false [2021-11-20 07:39:01,980 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from true [2021-11-20 07:39:21,505 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from false [2021-11-20 07:39:23,597 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|) |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse1 (fp.add c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) (let ((.cse4 (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4)))))) (and (fp.leq .cse1 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse1 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0))))))) is different from true [2021-11-20 07:39:47,432 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse2 .cse6)))))) (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)))))))) is different from false [2021-11-20 07:39:49,526 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse8 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| (let ((.cse0 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (not |c_ULTIMATE.start_main_#t~short7#1|) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse6 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse5 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse6)) (fp.sub c_currentRoundingMode .cse2 .cse6)))))) (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)))))))) is different from true [2021-11-20 07:41:22,569 WARN L227 SmtUtils]: Spent 1.55m on a formula simplification. DAG size of input: 33 DAG size of output: 11 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-11-20 07:41:22,569 INFO L354 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2021-11-20 07:41:22,570 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-20 07:43:10,878 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (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#1_8| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse3)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))))) is different from false [2021-11-20 07:43:12,971 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (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#1_8| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse3)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))))) is different from true [2021-11-20 07:43:12,971 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-20 07:43:12,972 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 07:43:12,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578978951] [2021-11-20 07:43:12,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578978951] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 07:43:12,972 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 07:43:12,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 20 [2021-11-20 07:43:12,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959114682] [2021-11-20 07:43:12,973 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 07:43:12,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-20 07:43:12,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 07:43:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-20 07:43:12,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=79, Unknown=20, NotChecked=270, Total=420 [2021-11-20 07:43:12,976 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-20 07:43:15,066 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (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#1_8| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse3)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-20 07:43:17,159 WARN L860 $PredicateComparison]: unable to prove that (and (or (forall ((v_arrayElimCell_7 (_ BitVec 32))) (not (= (fp ((_ extract 31 31) v_arrayElimCell_7) ((_ extract 30 23) v_arrayElimCell_7) ((_ extract 22 0) v_arrayElimCell_7)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))))) (forall ((v_arrayElimCell_10 (_ BitVec 32)) (|v_ULTIMATE.start_main_~t~0#1_8| (_ FloatingPoint 8 24)) (v_arrayElimCell_9 (_ BitVec 32)) (v_arrayElimCell_8 (_ BitVec 32)) (v_arrayElimCell_6 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_8) ((_ extract 30 23) v_arrayElimCell_8) ((_ extract 22 0) v_arrayElimCell_8))) (.cse3 (fp ((_ extract 31 31) v_arrayElimCell_9) ((_ extract 30 23) v_arrayElimCell_9) ((_ extract 22 0) v_arrayElimCell_9))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_10) ((_ extract 30 23) v_arrayElimCell_10) ((_ extract 22 0) v_arrayElimCell_10)))) (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#1_8| .cse2)) (fp.sub c_currentRoundingMode .cse3 .cse2))) ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (not (fp.leq |v_ULTIMATE.start_main_~t~0#1_8| .cse3)) (not (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~t~0#1_8| .cse2)) (not (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)))) (not (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)) .cse1)) (not (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-20 07:43:20,699 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse3 (not |c_ULTIMATE.start_main_#t~short7#1|)) (.cse1 (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse0 (let ((.cse12 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.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_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse5 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse7 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (let ((.cse2 (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse4))) (or (and (not .cse2) .cse3) (and .cse2 |c_ULTIMATE.start_main_#t~short7#1|))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5)) (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) .cse3 (let ((.cse6 (fp.add c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse4)) (fp.sub c_currentRoundingMode .cse0 .cse4))))) (and (fp.leq .cse6 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse6 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-20 07:43:22,742 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse3 (let ((.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse1 (not |c_ULTIMATE.start_main_#t~short7#1|)) (.cse5 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse7 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .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)))))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse5) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (let ((.cse6 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))) (or (and (not .cse6) .cse1) (and .cse6 |c_ULTIMATE.start_main_#t~short7#1|))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from false [2021-11-20 07:43:24,836 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse0 (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse3 (let ((.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (.cse1 (not |c_ULTIMATE.start_main_#t~short7#1|)) (.cse5 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse7 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse0 .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)))))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse5) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (let ((.cse6 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))) (or (and (not .cse6) .cse1) (and .cse6 |c_ULTIMATE.start_main_#t~short7#1|))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-20 07:43:26,883 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse1 (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 (let ((.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.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_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse7 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (or .cse0 (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse1 .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)))))) (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (let ((.cse6 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))) (or (and .cse6 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse0 (not .cse6)))) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse5) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from false [2021-11-20 07:43:28,977 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse1 (let ((.cse13 (select .cse10 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)))) (.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 (let ((.cse12 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.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_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse7 (let ((.cse9 (select .cse10 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse4 (let ((.cse8 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))))) (and (or .cse0 (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse1)) (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse5)) (fp.sub c_currentRoundingMode .cse1 .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)))))) (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (let ((.cse6 (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse7))) (or (and .cse6 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse0 (not .cse6)))) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse5) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse7 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-20 07:43:31,018 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse1 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (let ((.cse7 (select .cse8 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1)) (fp.sub c_currentRoundingMode .cse0 .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)))))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from false [2021-11-20 07:43:33,106 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|))) (let ((.cse2 (let ((.cse11 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|) |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (.cse0 (let ((.cse10 (select .cse8 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (.cse1 (let ((.cse9 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|) |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)))) (.cse3 (let ((.cse7 (select .cse8 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|) |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse1) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse3) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse0)) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse1)) (fp.sub c_currentRoundingMode .cse0 .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)))))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-20 07:43:36,457 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|)) (.cse13 (let ((.cse18 (select .cse11 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse15 (let ((.cse17 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (let ((.cse6 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse2 (let ((.cse12 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse6)))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))))) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse2)) (let ((.cse3 (fp.add c_currentRoundingMode (let ((.cse4 (select .cse5 (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse6)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) (let ((.cse9 (let ((.cse10 (select .cse11 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse6)))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse7 (select .cse8 (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse6)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse9)) (fp.sub c_currentRoundingMode .cse2 .cse9)))))) (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)))))))) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse13) (= (let ((.cse14 (select .cse5 |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse15) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= .cse13 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse15 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse16 (select .cse8 |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true [2021-11-20 07:43:38,499 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse8 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|)) (.cse12 (let ((.cse18 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse2 (let ((.cse17 (select .cse14 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse5 (let ((.cse16 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse6 (fp.add c_currentRoundingMode (let ((.cse7 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (let ((.cse11 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse9 (select .cse10 (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse11)) (fp.sub c_currentRoundingMode .cse12 .cse11)))))) (and (fp.leq .cse6 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse6 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem9#1| .cse12) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse15 (select .cse10 |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from false [2021-11-20 07:43:40,591 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_ULTIMATE.start_main_~#min~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#max~0#1.base|)) (.cse8 (bvmul |c_ULTIMATE.start_main_~i~0#1| (_ bv4 32)))) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#org~0#1.base|)) (.cse12 (let ((.cse18 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#max~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse18) ((_ extract 30 23) .cse18) ((_ extract 22 0) .cse18)))) (.cse2 (let ((.cse17 (select .cse14 |c_ULTIMATE.start_main_~#min~0#1.offset|))) (fp ((_ extract 31 31) .cse17) ((_ extract 30 23) .cse17) ((_ extract 22 0) .cse17)))) (.cse5 (let ((.cse16 (select .cse1 (bvadd (_ bv16 32) |c_ULTIMATE.start_main_~#max~0#1.offset|)))) (fp ((_ extract 31 31) .cse16) ((_ extract 30 23) .cse16) ((_ extract 22 0) .cse16)))) (.cse10 (select |c_#memory_int| |c_ULTIMATE.start_main_~#slope~0#1.base|))) (and (= |c_ULTIMATE.start_main_~#max~0#1.offset| (_ bv0 32)) (= (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~#max~0#1.offset|))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~#org~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_~#slope~0#1.offset| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~t~0#1| .cse2) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#org~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (= |c_ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~t~0#1| .cse5) (or (not (fp.leq |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_#t~mem9#1|)) (let ((.cse6 (fp.add c_currentRoundingMode (let ((.cse7 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#org~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) (let ((.cse11 (let ((.cse13 (select .cse14 (bvadd |c_ULTIMATE.start_main_~#min~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13))))) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode (let ((.cse9 (select .cse10 (bvadd |c_ULTIMATE.start_main_~#slope~0#1.offset| .cse8)))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~t~0#1| .cse11)) (fp.sub c_currentRoundingMode .cse12 .cse11)))))) (and (fp.leq .cse6 ((_ to_fp 8 24) c_currentRoundingMode 30.0)) (fp.geq .cse6 (fp.neg ((_ to_fp 8 24) c_currentRoundingMode 10.0)))))) (= |c_ULTIMATE.start_main_~#min~0#1.offset| (_ bv0 32)) (= |c_ULTIMATE.start_main_#t~mem9#1| .cse12) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (let ((.cse15 (select .cse10 |c_ULTIMATE.start_main_~#slope~0#1.offset|))) (fp ((_ extract 31 31) .cse15) ((_ extract 30 23) .cse15) ((_ extract 22 0) .cse15))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv4 32)))))) is different from true