./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7e70badd Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G --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 bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:35:36,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:35:36,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:35:36,067 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:35:36,068 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:35:36,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:35:36,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:35:36,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:35:36,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:35:36,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:35:36,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:35:36,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:35:36,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:35:36,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:35:36,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:35:36,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:35:36,104 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:35:36,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:35:36,117 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:35:36,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:35:36,126 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:35:36,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:35:36,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:35:36,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:35:36,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:35:36,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:35:36,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:35:36,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:35:36,156 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:35:36,158 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:35:36,164 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:35:36,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:35:36,168 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:35:36,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:35:36,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:35:36,174 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:35:36,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:35:36,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:35:36,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:35:36,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:35:36,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:35:36,181 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-23 13:35:36,247 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:35:36,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:35:36,250 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:35:36,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:35:36,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:35:36,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:35:36,253 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:35:36,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:35:36,254 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:35:36,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 13:35:36,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:35:36,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:35:36,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 13:35:36,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:35:36,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 13:35:36,258 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:35:36,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 13:35:36,258 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:35:36,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 13:35:36,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:35:36,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:35:36,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:35:36,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:35:36,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:35:36,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:35:36,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 13:35:36,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-23 13:35:36,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 13:35:36,262 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 13:35:36,264 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 13:35:36,264 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 13:35:36,264 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:35:36,265 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_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/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_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G 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 -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc [2021-11-23 13:35:36,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:35:36,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:35:36,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:35:36,700 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:35:36,701 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:35:36,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-23 13:35:36,810 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data/fb8a5cc72/a185db7301b3472eba841ed32c38f751/FLAG2f370a369 [2021-11-23 13:35:37,388 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:35:37,388 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-23 13:35:37,397 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data/fb8a5cc72/a185db7301b3472eba841ed32c38f751/FLAG2f370a369 [2021-11-23 13:35:37,740 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data/fb8a5cc72/a185db7301b3472eba841ed32c38f751 [2021-11-23 13:35:37,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:35:37,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:35:37,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:35:37,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:35:37,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:35:37,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:35:37" (1/1) ... [2021-11-23 13:35:37,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2d5fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:37, skipping insertion in model container [2021-11-23 13:35:37,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:35:37" (1/1) ... [2021-11-23 13:35:37,765 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:35:37,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:35:37,993 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_f71db1cb-cbb0-41b6-bef5-03a682f7353b/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-23 13:35:38,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:35:38,027 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:35:38,041 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_f71db1cb-cbb0-41b6-bef5-03a682f7353b/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-23 13:35:38,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:35:38,068 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:35:38,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38 WrapperNode [2021-11-23 13:35:38,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:35:38,070 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:35:38,071 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:35:38,071 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:35:38,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,115 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2021-11-23 13:35:38,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:35:38,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:35:38,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:35:38,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:35:38,131 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,134 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:35:38,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:35:38,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:35:38,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:35:38,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (1/1) ... [2021-11-23 13:35:38,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:35:38,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:35:38,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:35:38,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:35:38,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:35:38,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 13:35:38,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:35:38,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:35:38,339 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:35:38,341 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:35:38,480 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:35:38,488 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:35:38,488 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 13:35:38,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:35:38 BoogieIcfgContainer [2021-11-23 13:35:38,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:35:38,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:35:38,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:35:38,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:35:38,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:35:37" (1/3) ... [2021-11-23 13:35:38,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10631055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:35:38, skipping insertion in model container [2021-11-23 13:35:38,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:38" (2/3) ... [2021-11-23 13:35:38,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10631055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:35:38, skipping insertion in model container [2021-11-23 13:35:38,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:35:38" (3/3) ... [2021-11-23 13:35:38,503 INFO L111 eAbstractionObserver]: Analyzing ICFG loop3.c [2021-11-23 13:35:38,510 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:35:38,510 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 13:35:38,617 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:35:38,628 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-23 13:35:38,644 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 13:35:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-23 13:35:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 13:35:38,685 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:35:38,701 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:35:38,701 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:35:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:35:38,709 INFO L85 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2021-11-23 13:35:38,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:35:38,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688708880] [2021-11-23 13:35:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:35:38,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:35:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:35:38,911 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-23 13:35:38,912 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:35:38,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688708880] [2021-11-23 13:35:38,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688708880] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:35:38,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:35:38,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-23 13:35:38,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473559640] [2021-11-23 13:35:38,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:35:38,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-23 13:35:38,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:35:38,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-23 13:35:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 13:35:38,970 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-23 13:35:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:35:38,995 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-11-23 13:35:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 13:35:38,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2021-11-23 13:35:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:35:39,009 INFO L225 Difference]: With dead ends: 29 [2021-11-23 13:35:39,010 INFO L226 Difference]: Without dead ends: 12 [2021-11-23 13:35:39,014 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-23 13:35:39,024 INFO L933 BasicCegarLoop]: 17 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, 17 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-23 13:35:39,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:35:39,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-23 13:35:39,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-23 13:35:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:35:39,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-11-23 13:35:39,064 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2021-11-23 13:35:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:35:39,065 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-11-23 13:35:39,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-23 13:35:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-11-23 13:35:39,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 13:35:39,067 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:35:39,067 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:35:39,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 13:35:39,068 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:35:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:35:39,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2021-11-23 13:35:39,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:35:39,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420061726] [2021-11-23 13:35:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:35:39,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:35:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:35:39,210 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-23 13:35:39,210 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-23 13:35:39,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420061726] [2021-11-23 13:35:39,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420061726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 13:35:39,211 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:35:39,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 13:35:39,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134359208] [2021-11-23 13:35:39,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 13:35:39,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 13:35:39,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-23 13:35:39,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 13:35:39,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 13:35:39,215 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:35:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:35:39,240 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-11-23 13:35:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 13:35:39,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-23 13:35:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:35:39,242 INFO L225 Difference]: With dead ends: 23 [2021-11-23 13:35:39,242 INFO L226 Difference]: Without dead ends: 15 [2021-11-23 13:35:39,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-23 13:35:39,245 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 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-23 13:35:39,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:35:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-11-23 13:35:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-11-23 13:35:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-23 13:35:39,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-23 13:35:39,252 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-11-23 13:35:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:35:39,252 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-23 13:35:39,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:35:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-11-23 13:35:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 13:35:39,253 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:35:39,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:35:39,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 13:35:39,254 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:35:39,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:35:39,256 INFO L85 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2021-11-23 13:35:39,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-23 13:35:39,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492509045] [2021-11-23 13:35:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:35:39,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 13:35:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 13:35:39,283 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-23 13:35:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-23 13:35:39,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-23 13:35:39,331 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-23 13:35:39,333 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-23 13:35:39,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 13:35:39,341 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-23 13:35:39,344 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 13:35:39,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:35:39 BoogieIcfgContainer [2021-11-23 13:35:39,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 13:35:39,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 13:35:39,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 13:35:39,378 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 13:35:39,379 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:35:38" (3/4) ... [2021-11-23 13:35:39,383 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-23 13:35:39,383 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 13:35:39,385 INFO L158 Benchmark]: Toolchain (without parser) took 1639.44ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 39.8MB in the beginning and 51.4MB in the end (delta: -11.6MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2021-11-23 13:35:39,385 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 77.6MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:35:39,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.47ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 39.6MB in the beginning and 70.5MB in the end (delta: -30.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2021-11-23 13:35:39,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.54ms. Allocated memory is still 94.4MB. Free memory was 70.4MB in the beginning and 68.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:35:39,388 INFO L158 Benchmark]: Boogie Preprocessor took 32.55ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 67.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-23 13:35:39,388 INFO L158 Benchmark]: RCFGBuilder took 341.25ms. Allocated memory is still 94.4MB. Free memory was 67.7MB in the beginning and 58.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-23 13:35:39,389 INFO L158 Benchmark]: TraceAbstraction took 883.68ms. Allocated memory is still 94.4MB. Free memory was 58.0MB in the beginning and 51.8MB in the end (delta: 6.2MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2021-11-23 13:35:39,390 INFO L158 Benchmark]: Witness Printer took 5.29ms. Allocated memory is still 94.4MB. Free memory was 51.8MB in the beginning and 51.4MB in the end (delta: 403.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 13:35:39,394 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.34ms. Allocated memory is still 77.6MB. Free memory is still 56.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.47ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 39.6MB in the beginning and 70.5MB in the end (delta: -30.9MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.54ms. Allocated memory is still 94.4MB. Free memory was 70.4MB in the beginning and 68.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.55ms. Allocated memory is still 94.4MB. Free memory was 68.9MB in the beginning and 67.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 341.25ms. Allocated memory is still 94.4MB. Free memory was 67.7MB in the beginning and 58.4MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 883.68ms. Allocated memory is still 94.4MB. Free memory was 58.0MB in the beginning and 51.8MB in the end (delta: 6.2MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Witness Printer took 5.29ms. Allocated memory is still 94.4MB. Free memory was 51.8MB in the beginning and 51.4MB in the end (delta: 403.4kB). 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: 13]: 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 51, overapproximation of to_real at line 22, overapproximation of someBinaryArithmeticFLOAToperation at line 37. Possible FailurePath: [L15] float pi = 3.14159 ; VAL [pi=314159/100000] [L21] float x = __VERIFIER_nondet_float() ; [L22] float octant1 = 0 ; [L23] float octant2 = pi/8 ; [L24] CALL assume_abort_if_not(x > octant1 && x < octant2) [L11] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, pi=314159/100000] [L24] RET assume_abort_if_not(x > octant1 && x < octant2) [L25] float oddExp = x ; [L26] float evenExp = 1.0 ; [L27] float term = x ; [L28] unsigned int count = 2 ; [L29] int multFactor = 0 ; [L30] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, term=49, x=49] [L32] COND TRUE 1 [L34] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, x=49] [L35] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, x=49] [L35] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L37] evenExp = evenExp + multFactor*term [L39] count++ [L41] term = term * (x/count) [L43] oddExp = oddExp + multFactor*term [L45] count++ [L47] temp = __VERIFIER_nondet_int() [L48] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=49] [L51] CALL __VERIFIER_assert( evenExp >= oddExp ) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L13] reach_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, 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, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 28 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 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-23 13:35:39,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/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_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G --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 bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc --- Real Ultimate output --- This is Ultimate 0.2.1-dev-7e70bad [2021-11-23 13:35:42,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 13:35:42,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 13:35:42,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 13:35:42,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 13:35:42,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 13:35:42,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 13:35:42,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 13:35:42,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 13:35:42,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 13:35:42,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 13:35:42,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 13:35:42,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 13:35:42,661 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 13:35:42,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 13:35:42,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 13:35:42,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 13:35:42,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 13:35:42,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 13:35:42,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 13:35:42,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 13:35:42,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 13:35:42,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 13:35:42,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 13:35:42,689 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 13:35:42,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 13:35:42,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 13:35:42,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 13:35:42,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 13:35:42,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 13:35:42,695 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 13:35:42,696 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 13:35:42,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 13:35:42,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 13:35:42,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 13:35:42,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 13:35:42,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 13:35:42,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 13:35:42,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 13:35:42,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 13:35:42,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 13:35:42,734 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-23 13:35:42,768 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 13:35:42,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 13:35:42,769 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 13:35:42,769 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 13:35:42,771 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-23 13:35:42,771 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-23 13:35:42,771 INFO L138 SettingsManager]: * Use SBE=true [2021-11-23 13:35:42,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 13:35:42,772 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 13:35:42,772 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 13:35:42,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 13:35:42,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 13:35:42,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 13:35:42,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 13:35:42,774 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-23 13:35:42,774 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-23 13:35:42,774 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-23 13:35:42,775 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 13:35:42,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 13:35:42,775 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 13:35:42,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 13:35:42,776 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 13:35:42,776 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-23 13:35:42,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 13:35:42,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:35:42,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 13:35:42,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 13:35:42,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 13:35:42,778 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-23 13:35:42,778 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-23 13:35:42,779 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-23 13:35:42,779 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-23 13:35:42,779 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 13:35:42,780 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 13:35:42,780 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 13:35:42,780 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_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/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_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G 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 -> bd7fa6dfe7a0889f513bad4c7cfc96eb426f92168ff26ce4409068874579f6bc [2021-11-23 13:35:43,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 13:35:43,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 13:35:43,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 13:35:43,342 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 13:35:43,343 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 13:35:43,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-23 13:35:43,441 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data/8c5c23b0c/a219b2db1b954adbb4bab3500bb402e0/FLAG9dba18fe0 [2021-11-23 13:35:44,116 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 13:35:44,117 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2021-11-23 13:35:44,126 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data/8c5c23b0c/a219b2db1b954adbb4bab3500bb402e0/FLAG9dba18fe0 [2021-11-23 13:35:44,519 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/data/8c5c23b0c/a219b2db1b954adbb4bab3500bb402e0 [2021-11-23 13:35:44,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 13:35:44,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 13:35:44,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 13:35:44,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 13:35:44,536 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 13:35:44,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:35:44" (1/1) ... [2021-11-23 13:35:44,540 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495e0bb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:44, skipping insertion in model container [2021-11-23 13:35:44,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:35:44" (1/1) ... [2021-11-23 13:35:44,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 13:35:44,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 13:35:44,867 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_f71db1cb-cbb0-41b6-bef5-03a682f7353b/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-23 13:35:44,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:35:44,932 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 13:35:44,967 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_f71db1cb-cbb0-41b6-bef5-03a682f7353b/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c[472,485] [2021-11-23 13:35:45,024 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 13:35:45,062 INFO L208 MainTranslator]: Completed translation [2021-11-23 13:35:45,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45 WrapperNode [2021-11-23 13:35:45,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 13:35:45,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 13:35:45,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 13:35:45,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 13:35:45,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,136 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2021-11-23 13:35:45,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 13:35:45,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 13:35:45,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 13:35:45,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 13:35:45,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 13:35:45,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 13:35:45,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 13:35:45,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 13:35:45,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (1/1) ... [2021-11-23 13:35:45,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 13:35:45,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/z3 [2021-11-23 13:35:45,262 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 13:35:45,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 13:35:45,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 13:35:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-23 13:35:45,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 13:35:45,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 13:35:45,437 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 13:35:45,439 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 13:35:50,059 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 13:35:50,066 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 13:35:50,066 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-23 13:35:50,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:35:50 BoogieIcfgContainer [2021-11-23 13:35:50,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 13:35:50,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 13:35:50,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 13:35:50,076 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 13:35:50,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:35:44" (1/3) ... [2021-11-23 13:35:50,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0821f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:35:50, skipping insertion in model container [2021-11-23 13:35:50,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:35:45" (2/3) ... [2021-11-23 13:35:50,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0821f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:35:50, skipping insertion in model container [2021-11-23 13:35:50,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:35:50" (3/3) ... [2021-11-23 13:35:50,081 INFO L111 eAbstractionObserver]: Analyzing ICFG loop3.c [2021-11-23 13:35:50,088 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 13:35:50,089 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-23 13:35:50,149 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 13:35:50,158 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-23 13:35:50,158 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-23 13:35:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-23 13:35:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-23 13:35:50,181 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:35:50,182 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:35:50,183 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:35:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:35:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2021-11-23 13:35:50,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-23 13:35:50,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685975032] [2021-11-23 13:35:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:35:50,209 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 13:35:50,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat [2021-11-23 13:35:50,214 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 13:35:50,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-23 13:35:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:35:50,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-23 13:35:50,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:35:50,497 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-23 13:35:50,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:35:50,547 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-23 13:35:50,548 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-23 13:35:50,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685975032] [2021-11-23 13:35:50,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685975032] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 13:35:50,550 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:35:50,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-23 13:35:50,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408576722] [2021-11-23 13:35:50,554 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 13:35:50,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-23 13:35:50,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-23 13:35:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-23 13:35:50,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-23 13:35:50,601 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-23 13:35:50,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:35:50,623 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-11-23 13:35:50,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-23 13:35:50,626 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2021-11-23 13:35:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:35:50,634 INFO L225 Difference]: With dead ends: 29 [2021-11-23 13:35:50,635 INFO L226 Difference]: Without dead ends: 12 [2021-11-23 13:35:50,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-23 13:35:50,642 INFO L933 BasicCegarLoop]: 17 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, 17 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-23 13:35:50,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 13:35:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-23 13:35:50,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-23 13:35:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:35:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-11-23 13:35:50,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2021-11-23 13:35:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:35:50,681 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-11-23 13:35:50,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-23 13:35:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-11-23 13:35:50,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 13:35:50,683 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:35:50,683 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:35:50,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-23 13:35:50,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 [2021-11-23 13:35:50,897 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:35:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:35:50,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2021-11-23 13:35:50,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-23 13:35:50,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177391090] [2021-11-23 13:35:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:35:50,902 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 13:35:50,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat [2021-11-23 13:35:50,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 13:35:50,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-23 13:35:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:35:51,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 13:35:51,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:35:51,888 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-23 13:35:51,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:35:51,997 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-23 13:35:51,997 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-23 13:35:51,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177391090] [2021-11-23 13:35:51,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177391090] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 13:35:51,998 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:35:51,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-23 13:35:51,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860814468] [2021-11-23 13:35:51,999 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 13:35:52,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 13:35:52,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-23 13:35:52,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 13:35:52,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:35:52,003 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-23 13:35:54,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-23 13:35:56,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-23 13:35:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:35:57,050 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-11-23 13:35:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 13:35:57,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 11 [2021-11-23 13:35:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:35:57,052 INFO L225 Difference]: With dead ends: 24 [2021-11-23 13:35:57,052 INFO L226 Difference]: Without dead ends: 16 [2021-11-23 13:35:57,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-23 13:35:57,055 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:35:57,056 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 5.0s Time] [2021-11-23 13:35:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-23 13:35:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2021-11-23 13:35:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 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-23 13:35:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-23 13:35:57,063 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-11-23 13:35:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:35:57,064 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-23 13:35:57,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-23 13:35:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-11-23 13:35:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-23 13:35:57,066 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:35:57,066 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:35:57,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-23 13:35:57,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 [2021-11-23 13:35:57,289 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:35:57,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:35:57,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2021-11-23 13:35:57,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-23 13:35:57,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628597902] [2021-11-23 13:35:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:35:57,292 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 13:35:57,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat [2021-11-23 13:35:57,296 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 13:35:57,303 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-23 13:36:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:36:01,019 WARN L261 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 21 conjunts are in the unsatisfiable core [2021-11-23 13:36:01,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:36:46,793 WARN L227 SmtUtils]: Spent 19.33s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 13:37:31,749 WARN L227 SmtUtils]: Spent 20.17s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 13:37:51,924 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from false [2021-11-23 13:37:54,016 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from true [2021-11-23 13:39:12,112 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (or (and (not .cse0) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2021-11-23 13:39:14,200 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (or (and (not .cse0) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2021-11-23 13:39:30,962 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2021-11-23 13:39:33,047 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2021-11-23 13:39:33,048 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-23 13:39:33,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:39:42,313 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from false [2021-11-23 13:39:44,418 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from true [2021-11-23 13:39:50,696 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from false [2021-11-23 13:39:52,780 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from true [2021-11-23 13:39:59,281 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from false [2021-11-23 13:40:01,431 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from true [2021-11-23 13:40:07,872 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) is different from false [2021-11-23 13:40:10,015 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) is different from true [2021-11-23 13:40:21,208 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) is different from false [2021-11-23 13:40:23,378 WARN L860 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) is different from true [2021-11-23 13:40:40,450 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_6| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))))) is different from true [2021-11-23 13:40:40,451 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-23 13:40:40,452 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-23 13:40:40,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628597902] [2021-11-23 13:40:40,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628597902] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-23 13:40:40,453 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-23 13:40:40,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2021-11-23 13:40:40,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391161442] [2021-11-23 13:40:40,454 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-23 13:40:40,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-23 13:40:40,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-23 13:40:40,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-23 13:40:40,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=67, Unknown=17, NotChecked=216, Total=342 [2021-11-23 13:40:40,459 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-23 13:40:42,606 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_6| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from false [2021-11-23 13:40:44,791 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_6| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from true [2021-11-23 13:40:46,964 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (let ((.cse1 (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (.cse0 (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (or (and .cse0 .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse2 (or (not .cse1) (not .cse0))))) (or .cse2 (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse4 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse3 .cse4)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-23 13:40:49,142 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (let ((.cse1 (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))) (.cse0 (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))) (or (and .cse0 .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse2 (or (not .cse1) (not .cse0))))) (or .cse2 (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse4 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse3 .cse4)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-23 13:40:51,313 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-23 13:40:53,499 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.geq (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))))) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-23 13:40:55,671 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) (= |c_ULTIMATE.start_main_~term~0#1| |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-23 13:40:57,954 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) (= |c_ULTIMATE.start_main_~term~0#1| |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-23 13:41:00,129 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-23 13:41:02,245 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-23 13:41:04,422 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_#t~ite5#1|) (_ bv0 32))) is different from false [2021-11-23 13:41:06,564 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_#t~ite5#1|) (_ bv0 32))) is different from true [2021-11-23 13:41:08,747 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~evenExp~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))))))) is different from false [2021-11-23 13:41:10,937 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (or (and (not .cse0) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse0))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2021-11-23 13:41:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:41:10,969 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-11-23 13:41:10,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 13:41:10,971 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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) Word has length 11 [2021-11-23 13:41:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:41:10,973 INFO L225 Difference]: With dead ends: 20 [2021-11-23 13:41:10,973 INFO L226 Difference]: Without dead ends: 16 [2021-11-23 13:41:10,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 127.3s TimeCoverageRelationStatistics Valid=58, Invalid=69, Unknown=31, NotChecked=544, Total=702 [2021-11-23 13:41:10,978 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-23 13:41:10,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 44 Unchecked, 0.0s Time] [2021-11-23 13:41:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-11-23 13:41:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-11-23 13:41:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-23 13:41:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-11-23 13:41:10,989 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-11-23 13:41:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:41:10,990 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-11-23 13:41:10,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 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-23 13:41:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-11-23 13:41:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 13:41:10,992 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:41:10,993 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:41:11,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-23 13:41:11,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 [2021-11-23 13:41:11,196 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:41:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:41:11,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1599389039, now seen corresponding path program 1 times [2021-11-23 13:41:11,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-23 13:41:11,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171799170] [2021-11-23 13:41:11,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:41:11,201 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 13:41:11,201 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat [2021-11-23 13:41:11,203 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 13:41:11,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-23 13:41:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:41:13,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 13:41:13,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:41:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:41:13,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:41:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 13:41:14,126 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-23 13:41:14,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171799170] [2021-11-23 13:41:14,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171799170] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:41:14,127 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:41:14,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-23 13:41:14,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444587324] [2021-11-23 13:41:14,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:41:14,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 13:41:14,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-23 13:41:14,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 13:41:14,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-23 13:41:14,131 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-23 13:41:16,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-23 13:41:19,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-23 13:41:21,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-23 13:41:24,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-23 13:41:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 13:41:24,247 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-11-23 13:41:24,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 13:41:24,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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) Word has length 15 [2021-11-23 13:41:24,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 13:41:24,250 INFO L225 Difference]: With dead ends: 35 [2021-11-23 13:41:24,250 INFO L226 Difference]: Without dead ends: 27 [2021-11-23 13:41:24,251 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-23 13:41:24,253 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2021-11-23 13:41:24,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 4 Unknown, 0 Unchecked, 10.1s Time] [2021-11-23 13:41:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-11-23 13:41:24,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-11-23 13:41:24,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-23 13:41:24,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-11-23 13:41:24,267 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2021-11-23 13:41:24,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 13:41:24,268 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-11-23 13:41:24,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-23 13:41:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-11-23 13:41:24,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-23 13:41:24,270 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 13:41:24,271 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 13:41:24,318 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-23 13:41:24,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 [2021-11-23 13:41:24,477 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 13:41:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 13:41:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1656647341, now seen corresponding path program 1 times [2021-11-23 13:41:24,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-23 13:41:24,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046173279] [2021-11-23 13:41:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 13:41:24,480 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-23 13:41:24,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat [2021-11-23 13:41:24,482 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-23 13:41:24,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f71db1cb-cbb0-41b6-bef5-03a682f7353b/bin/uautomizer-wIGwrQj20G/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-23 13:42:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 13:42:01,813 WARN L261 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 28 conjunts are in the unsatisfiable core [2021-11-23 13:42:01,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 13:42:55,629 WARN L227 SmtUtils]: Spent 22.96s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 13:43:54,884 WARN L227 SmtUtils]: Spent 25.49s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 13:44:29,290 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|)))) |c_ULTIMATE.start_main_~term~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|))) is different from false [2021-11-23 13:44:31,449 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (and (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|)))) |c_ULTIMATE.start_main_~term~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|))) is different from true [2021-11-23 13:45:37,852 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (and (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse2))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)))) is different from false [2021-11-23 13:45:39,934 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (and (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse2))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)))) is different from true [2021-11-23 13:46:19,596 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (and (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|)))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32)))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse2))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_#t~ite5#1|) (_ bv0 32)) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)))) is different from false [2021-11-23 13:46:41,184 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from false [2021-11-23 13:46:43,318 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from true [2021-11-23 13:48:05,396 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2021-11-23 13:48:07,530 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (let ((.cse0 (let ((.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse0)) (and .cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2021-11-23 13:48:25,995 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2021-11-23 13:48:28,125 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2021-11-23 13:48:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-23 13:48:28,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 13:48:36,869 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from false [2021-11-23 13:48:38,969 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from true [2021-11-23 13:48:45,207 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from false [2021-11-23 13:48:47,293 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from true [2021-11-23 13:48:53,667 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from false [2021-11-23 13:48:55,785 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))))) is different from true [2021-11-23 13:49:06,665 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))))))) is different from false [2021-11-23 13:49:08,868 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))))))) is different from true [2021-11-23 13:49:15,457 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))))))) is different from false [2021-11-23 13:49:17,636 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|))))))))) is different from true [2021-11-23 13:49:24,372 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))))))) is different from false [2021-11-23 13:49:26,616 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))))))) is different from true [2021-11-23 13:49:33,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) is different from false [2021-11-23 13:49:35,317 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) is different from true [2021-11-23 13:49:46,475 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))) is different from false [2021-11-23 13:49:48,660 WARN L860 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))) is different from true [2021-11-23 13:50:05,179 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_7| (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_7| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) is different from true [2021-11-23 13:50:05,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-23 13:50:05,180 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-23 13:50:05,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046173279] [2021-11-23 13:50:05,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046173279] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 13:50:05,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-23 13:50:05,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2021-11-23 13:50:05,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835687769] [2021-11-23 13:50:05,181 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-23 13:50:05,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-23 13:50:05,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-23 13:50:05,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-23 13:50:05,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=61, Unknown=35, NotChecked=450, Total=600 [2021-11-23 13:50:05,184 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-23 13:50:07,341 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_ULTIMATE.start_main_~x~0#1_7| (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_7| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from false [2021-11-23 13:50:09,514 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((|v_ULTIMATE.start_main_~x~0#1_7| (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 .cse2)) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))) (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_7| ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_7| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv8 32))))))) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from true