./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:12:45,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:12:46,015 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:12:46,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:12:46,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:12:46,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:12:46,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:12:46,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:12:46,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:12:46,048 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:12:46,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:12:46,049 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:12:46,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:12:46,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:12:46,051 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:12:46,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:12:46,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:12:46,052 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:12:46,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:12:46,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:12:46,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:12:46,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:12:46,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:12:46,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:12:46,057 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:12:46,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:12:46,058 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:12:46,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:12:46,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:12:46,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:12:46,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:12:46,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:12:46,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:12:46,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:12:46,060 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:12:46,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:12:46,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:12:46,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:12:46,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:12:46,061 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:12:46,061 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:12:46,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:12:46,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/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_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2023-11-29 05:12:46,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:12:46,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:12:46,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:12:46,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:12:46,304 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:12:46,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2023-11-29 05:12:49,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:12:49,234 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:12:49,235 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2023-11-29 05:12:49,240 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/data/9e2d0e3bf/f6b196e5e85c4b43ae225cc6777ab359/FLAGb892c63d8 [2023-11-29 05:12:49,252 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/data/9e2d0e3bf/f6b196e5e85c4b43ae225cc6777ab359 [2023-11-29 05:12:49,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:12:49,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:12:49,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:12:49,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:12:49,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:12:49,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b184fbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49, skipping insertion in model container [2023-11-29 05:12:49,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,283 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:12:49,418 WARN L240 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_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2023-11-29 05:12:49,434 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:12:49,442 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:12:49,451 WARN L240 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_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2023-11-29 05:12:49,458 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:12:49,469 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:12:49,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49 WrapperNode [2023-11-29 05:12:49,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:12:49,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:12:49,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:12:49,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:12:49,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,496 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2023-11-29 05:12:49,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:12:49,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:12:49,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:12:49,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:12:49,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,516 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 05:12:49,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:12:49,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:12:49,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:12:49,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:12:49,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (1/1) ... [2023-11-29 05:12:49,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:12:49,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:12:49,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:12:49,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:12:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:12:49,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:12:49,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:12:49,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:12:49,673 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:12:49,676 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:12:49,783 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:12:49,807 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:12:49,807 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:12:49,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:12:49 BoogieIcfgContainer [2023-11-29 05:12:49,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:12:49,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:12:49,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:12:49,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:12:49,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:12:49" (1/3) ... [2023-11-29 05:12:49,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1acb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:12:49, skipping insertion in model container [2023-11-29 05:12:49,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:49" (2/3) ... [2023-11-29 05:12:49,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d1acb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:12:49, skipping insertion in model container [2023-11-29 05:12:49,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:12:49" (3/3) ... [2023-11-29 05:12:49,817 INFO L112 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2023-11-29 05:12:49,836 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:12:49,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:12:49,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:12:49,889 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4818683, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:12:49,890 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:12:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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) [2023-11-29 05:12:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 05:12:49,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:49,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:49,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:49,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:49,906 INFO L85 PathProgramCache]: Analyzing trace with hash 515220282, now seen corresponding path program 1 times [2023-11-29 05:12:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:49,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350833173] [2023-11-29 05:12:49,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:49,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:50,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350833173] [2023-11-29 05:12:50,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350833173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:50,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:50,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:12:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582563431] [2023-11-29 05:12:50,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:50,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:12:50,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:50,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:12:50,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:12:50,091 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-11-29 05:12:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:50,111 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2023-11-29 05:12:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:12:50,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-11-29 05:12:50,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:50,121 INFO L225 Difference]: With dead ends: 20 [2023-11-29 05:12:50,121 INFO L226 Difference]: Without dead ends: 9 [2023-11-29 05:12:50,123 INFO L412 NwaCegarLoop]: 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 [2023-11-29 05:12:50,127 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:50,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:12:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-29 05:12:50,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-29 05:12:50,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:12:50,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-29 05:12:50,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2023-11-29 05:12:50,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:50,159 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-29 05:12:50,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-11-29 05:12:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-29 05:12:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 05:12:50,160 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:50,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:50,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:12:50,161 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:50,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:50,162 INFO L85 PathProgramCache]: Analyzing trace with hash 568632303, now seen corresponding path program 1 times [2023-11-29 05:12:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:50,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816016935] [2023-11-29 05:12:50,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:50,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:12:50,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:12:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:12:50,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:12:50,248 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:12:50,250 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:12:50,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:12:50,255 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-29 05:12:50,258 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:12:50,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:12:50 BoogieIcfgContainer [2023-11-29 05:12:50,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:12:50,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:12:50,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:12:50,278 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:12:50,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:12:49" (3/4) ... [2023-11-29 05:12:50,280 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:12:50,281 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:12:50,282 INFO L158 Benchmark]: Toolchain (without parser) took 1026.18ms. Allocated memory is still 138.4MB. Free memory was 108.4MB in the beginning and 57.7MB in the end (delta: 50.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2023-11-29 05:12:50,282 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:12:50,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.65ms. Allocated memory is still 138.4MB. Free memory was 107.9MB in the beginning and 97.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:12:50,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.72ms. Allocated memory is still 138.4MB. Free memory was 97.4MB in the beginning and 95.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:12:50,284 INFO L158 Benchmark]: Boogie Preprocessor took 31.95ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:12:50,284 INFO L158 Benchmark]: RCFGBuilder took 278.80ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 83.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 05:12:50,285 INFO L158 Benchmark]: TraceAbstraction took 466.55ms. Allocated memory is still 138.4MB. Free memory was 82.8MB in the beginning and 58.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-29 05:12:50,285 INFO L158 Benchmark]: Witness Printer took 3.23ms. Allocated memory is still 138.4MB. Free memory was 58.2MB in the beginning and 57.7MB in the end (delta: 518.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:12:50,288 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 138.4MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.65ms. Allocated memory is still 138.4MB. Free memory was 107.9MB in the beginning and 97.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.72ms. Allocated memory is still 138.4MB. Free memory was 97.4MB in the beginning and 95.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.95ms. Allocated memory is still 138.4MB. Free memory was 95.9MB in the beginning and 93.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 278.80ms. Allocated memory is still 138.4MB. Free memory was 93.8MB in the beginning and 83.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 466.55ms. Allocated memory is still 138.4MB. Free memory was 82.8MB in the beginning and 58.2MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 3.23ms. Allocated memory is still 138.4MB. Free memory was 58.2MB in the beginning and 57.7MB in the end (delta: 518.8kB). 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: 12]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 32. Possible FailurePath: [L14] float pi = 3.14159 ; [L20] float x = __VERIFIER_nondet_float() ; [L21] float octant = pi/3 ; [L22] CALL assume_abort_if_not(x > octant && x < pi) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, pi=314159/100000] [L22] RET assume_abort_if_not(x > octant && x < pi) [L23] float oddExp = x ; [L24] float evenExp = 1.0 ; [L25] float term = x ; [L26] unsigned int count = 2 ; [L27] int multFactor = 0 ; [L28] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=53, pi=314159/100000, term=53, x=53] [L30] COND TRUE 1 [L32] term = term * (x/count) [L33] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L35] evenExp = evenExp + multFactor*term [L37] count++ [L39] term = term * (x/count) [L41] oddExp = oddExp + multFactor*term [L43] count++ [L45] temp = __VERIFIER_nondet_int() [L46] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=53] [L49] CALL __VERIFIER_assert( oddExp >= evenExp ) [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L12] reach_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 9 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 05:12:50,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:12:52,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:12:52,318 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 05:12:52,325 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:12:52,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:12:52,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:12:52,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:12:52,356 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:12:52,357 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:12:52,357 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:12:52,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:12:52,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:12:52,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:12:52,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:12:52,360 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:12:52,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:12:52,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:12:52,362 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:12:52,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:12:52,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:12:52,363 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:12:52,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:12:52,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:12:52,365 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:12:52,365 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:12:52,366 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:12:52,366 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:12:52,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:12:52,367 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:12:52,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:12:52,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:12:52,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:12:52,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:12:52,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:12:52,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:12:52,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:12:52,370 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:12:52,370 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:12:52,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:12:52,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:12:52,371 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:12:52,371 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:12:52,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:12:52,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:12:52,372 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:12:52,372 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/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_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2023-11-29 05:12:52,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:12:52,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:12:52,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:12:52,677 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:12:52,677 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:12:52,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2023-11-29 05:12:55,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:12:55,652 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:12:55,653 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2023-11-29 05:12:55,661 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/data/3f2c5f5c7/92dfd07cdca04763b42afabfcb22bb71/FLAG18bd2f3d2 [2023-11-29 05:12:55,676 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/data/3f2c5f5c7/92dfd07cdca04763b42afabfcb22bb71 [2023-11-29 05:12:55,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:12:55,681 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:12:55,682 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:12:55,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:12:55,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:12:55,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,690 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7805eb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55, skipping insertion in model container [2023-11-29 05:12:55,690 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,711 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:12:55,851 WARN L240 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_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2023-11-29 05:12:55,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:12:55,879 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:12:55,889 WARN L240 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_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2023-11-29 05:12:55,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:12:55,909 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:12:55,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55 WrapperNode [2023-11-29 05:12:55,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:12:55,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:12:55,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:12:55,910 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:12:55,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,943 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53 [2023-11-29 05:12:55,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:12:55,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:12:55,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:12:55,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:12:55,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,967 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 05:12:55,967 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:12:55,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:12:55,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:12:55,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:12:55,988 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (1/1) ... [2023-11-29 05:12:55,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:12:56,002 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:12:56,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:12:56,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:12:56,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:12:56,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:12:56,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:12:56,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:12:56,113 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:12:56,114 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:13:01,232 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:13:01,259 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:13:01,259 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:13:01,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:13:01 BoogieIcfgContainer [2023-11-29 05:13:01,260 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:13:01,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:13:01,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:13:01,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:13:01,265 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:12:55" (1/3) ... [2023-11-29 05:13:01,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d216781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:13:01, skipping insertion in model container [2023-11-29 05:13:01,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:55" (2/3) ... [2023-11-29 05:13:01,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d216781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:13:01, skipping insertion in model container [2023-11-29 05:13:01,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:13:01" (3/3) ... [2023-11-29 05:13:01,268 INFO L112 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2023-11-29 05:13:01,282 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:13:01,282 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:13:01,320 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:13:01,326 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@254086c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:13:01,326 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:13:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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) [2023-11-29 05:13:01,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 05:13:01,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:01,335 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:01,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:01,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:01,340 INFO L85 PathProgramCache]: Analyzing trace with hash 515220282, now seen corresponding path program 1 times [2023-11-29 05:13:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:13:01,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617554302] [2023-11-29 05:13:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:01,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:13:01,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:13:01,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:13:01,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 05:13:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:01,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 05:13:01,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:13:01,535 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:13:01,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:13:01,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617554302] [2023-11-29 05:13:01,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617554302] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:01,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:01,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:13:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790935020] [2023-11-29 05:13:01,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:01,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:13:01,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:13:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:13:01,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:13:01,585 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-11-29 05:13:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:01,618 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2023-11-29 05:13:01,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:13:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2023-11-29 05:13:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:01,628 INFO L225 Difference]: With dead ends: 20 [2023-11-29 05:13:01,629 INFO L226 Difference]: Without dead ends: 9 [2023-11-29 05:13:01,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:13:01,635 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:01,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:13:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-11-29 05:13:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2023-11-29 05:13:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:13:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2023-11-29 05:13:01,666 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2023-11-29 05:13:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:01,666 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2023-11-29 05:13:01,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) [2023-11-29 05:13:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2023-11-29 05:13:01,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 05:13:01,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:01,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:01,677 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:13:01,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:13:01,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:13:01,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:01,869 INFO L85 PathProgramCache]: Analyzing trace with hash 568632303, now seen corresponding path program 1 times [2023-11-29 05:13:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:13:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400741878] [2023-11-29 05:13:01,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:01,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:13:01,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:13:01,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:13:01,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 05:13:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:13,633 WARN L260 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:13:13,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:34,565 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:13:43,059 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:13:51,569 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:00,066 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:04,171 WARN L854 $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))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |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.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from false [2023-11-29 05:14:08,232 WARN L876 $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))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |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.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from true [2023-11-29 05:14:16,481 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:24,957 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:33,456 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:41,929 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:14:54,582 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:15:02,809 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:15:11,337 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:15:23,663 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:15:32,165 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:15:40,673 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:15:44,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (.cse2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))) (fp.geq (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| .cse2)))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse5) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| .cse5) (not (let ((.cse7 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse2)))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse0 .cse7))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse6))))))) is different from false [2023-11-29 05:15:57,522 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:16:05,737 WARN L293 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:16:12,347 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:16:16,455 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (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 |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)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from false [2023-11-29 05:16:20,514 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (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 |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)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from true [2023-11-29 05:16:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:16:20,515 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:16:20,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:16:20,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400741878] [2023-11-29 05:16:20,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400741878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:20,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:16:20,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:16:20,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013404866] [2023-11-29 05:16:20,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:20,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:16:20,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:16:20,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:16:20,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=13, Unknown=5, NotChecked=24, Total=56 [2023-11-29 05:16:20,518 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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) [2023-11-29 05:16:27,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:16:31,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:16:35,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:16:39,271 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (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))))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (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))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 05:16:45,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:16:49,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:16:53,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:16:53,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:53,438 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2023-11-29 05:16:53,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:16:53,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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 [2023-11-29 05:16:53,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:53,717 INFO L225 Difference]: With dead ends: 15 [2023-11-29 05:16:53,717 INFO L226 Difference]: Without dead ends: 11 [2023-11-29 05:16:53,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=20, Invalid=20, Unknown=6, NotChecked=44, Total=90 [2023-11-29 05:16:53,719 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:53,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 6 Unknown, 50 Unchecked, 25.2s Time] [2023-11-29 05:16:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-11-29 05:16:53,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-11-29 05:16:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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) [2023-11-29 05:16:53,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-11-29 05:16:53,723 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2023-11-29 05:16:53,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:53,724 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-11-29 05:16:53,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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) [2023-11-29 05:16:53,724 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-11-29 05:16:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 05:16:53,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:53,725 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:53,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 05:16:53,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:16:53,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:53,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:53,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1043471242, now seen corresponding path program 1 times [2023-11-29 05:16:53,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:16:53,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979611777] [2023-11-29 05:16:53,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:53,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:16:53,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:16:53,929 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:16:53,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 05:18:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:29,403 WARN L260 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 05:18:29,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:51,254 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:18:59,734 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:19:08,013 WARN L293 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:19:17,242 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:19:26,472 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:19:34,974 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:19:44,207 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:19:48,311 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.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))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |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 (_ bv3 32))))) (= (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|) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~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)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse2) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 05:19:54,383 WARN L293 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:02,943 WARN L293 SmtUtils]: Spent 8.56s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:11,229 WARN L293 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:20,447 WARN L293 SmtUtils]: Spent 9.22s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:29,704 WARN L293 SmtUtils]: Spent 9.26s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:38,239 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:47,534 WARN L293 SmtUtils]: Spent 9.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:20:56,262 WARN L293 SmtUtils]: Spent 8.72s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:05,097 WARN L293 SmtUtils]: Spent 8.83s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:13,957 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:22,775 WARN L293 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:26,972 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (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 .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.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.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from false [2023-11-29 05:21:31,072 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (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 .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.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.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from true [2023-11-29 05:21:39,768 WARN L293 SmtUtils]: Spent 8.69s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:48,544 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:21:57,321 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:06,106 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:19,153 WARN L293 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:27,520 WARN L293 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:36,344 WARN L293 SmtUtils]: Spent 8.82s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:48,879 WARN L293 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:22:57,726 WARN L293 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:23:06,553 WARN L293 SmtUtils]: Spent 8.83s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:23:10,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse10 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (.cse3 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse8 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse5 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (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| .cse3)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse9) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| .cse9) (let ((.cse13 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse11)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse3)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse0 .cse13)) (fp.mul roundNearestTiesToEven .cse0 .cse12)))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10))))))) is different from false [2023-11-29 05:23:23,431 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:23:32,227 WARN L293 SmtUtils]: Spent 8.80s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:23:41,005 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:23:45,162 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (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)))))) (fp.geq (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.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))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from false [2023-11-29 05:23:49,253 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (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)))))) (fp.geq (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.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))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from true [2023-11-29 05:23:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 05:23:49,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:24:01,374 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:24:09,895 WARN L293 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:24:18,484 WARN L293 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:24:26,711 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:24:30,835 WARN L854 $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 |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 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 |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from false [2023-11-29 05:24:34,963 WARN L876 $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 |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 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 |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from true [2023-11-29 05:24:43,221 WARN L293 SmtUtils]: Spent 8.25s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:24:51,864 WARN L293 SmtUtils]: Spent 8.64s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:00,377 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:08,608 WARN L293 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:17,693 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:26,764 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:35,253 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:44,328 WARN L293 SmtUtils]: Spent 9.07s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:25:52,766 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:02,343 WARN L293 SmtUtils]: Spent 9.57s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:07,518 WARN L293 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:16,746 WARN L293 SmtUtils]: Spent 9.23s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:22,278 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (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 ((.cse12 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse9 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse12 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse9))))) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse7 (fp.mul c_currentRoundingMode .cse8 (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|)))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse10 .cse7)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse5 (fp.mul c_currentRoundingMode .cse10 .cse8))) (and (or .cse0 (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse12))) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse11))) (.cse1 (= (bvlshr .cse9 (_ bv1 32)) (_ bv0 32)))) (and (or .cse1 (fp.geq (fp.add c_currentRoundingMode .cse2 .cse3) (fp.add c_currentRoundingMode .cse4 .cse5))) (or (fp.geq (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse6 .cse7)) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 .cse8))) (not .cse1))))) (or (not .cse0) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse12)) .cse3) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse11)) .cse5))))))))) is different from false [2023-11-29 05:26:26,570 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (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 ((.cse12 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse9 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse12 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse9))))) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse7 (fp.mul c_currentRoundingMode .cse8 (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|)))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse10 .cse7)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse5 (fp.mul c_currentRoundingMode .cse10 .cse8))) (and (or .cse0 (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse12))) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse11))) (.cse1 (= (bvlshr .cse9 (_ bv1 32)) (_ bv0 32)))) (and (or .cse1 (fp.geq (fp.add c_currentRoundingMode .cse2 .cse3) (fp.add c_currentRoundingMode .cse4 .cse5))) (or (fp.geq (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse6 .cse7)) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 .cse8))) (not .cse1))))) (or (not .cse0) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse12)) .cse3) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse11)) .cse5))))))))) is different from true [2023-11-29 05:26:34,932 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:39,105 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (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 (fp.mul c_currentRoundingMode .cse3 (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 .cse1 (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 |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (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)))))) (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 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from false [2023-11-29 05:26:43,284 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (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 (fp.mul c_currentRoundingMode .cse3 (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 .cse1 (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 |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (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)))))) (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 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from true [2023-11-29 05:26:52,132 WARN L293 SmtUtils]: Spent 8.85s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:27:00,516 WARN L293 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:27:04,689 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse3 (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 (fp.mul c_currentRoundingMode .cse3 (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 .cse1 (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 |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (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)))))) (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 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2023-11-29 05:27:08,853 WARN L876 $PredicateComparison]: unable to prove that (or (let ((.cse3 (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 (fp.mul c_currentRoundingMode .cse3 (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 .cse1 (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 |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (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)))))) (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 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2023-11-29 05:27:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-29 05:27:08,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:27:08,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979611777] [2023-11-29 05:27:08,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979611777] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:27:08,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:27:08,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-11-29 05:27:08,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134892405] [2023-11-29 05:27:08,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:27:08,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:27:08,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:27:08,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:27:08,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=31, Unknown=14, NotChecked=136, Total=210 [2023-11-29 05:27:08,857 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:27:13,088 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (let ((.cse0 (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse3)) (.cse1 (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse0 .cse1) (and (or (not .cse0) (not .cse1)) .cse2)))) (or (let ((.cse7 (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 ((.cse5 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse6 (fp.mul c_currentRoundingMode .cse5 (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 |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse4 .cse5)) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (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 .cse4 .cse7)) (fp.mul c_currentRoundingMode .cse4 .cse6)))))) .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 05:27:17,397 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (let ((.cse0 (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse3)) (.cse1 (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse0 .cse1) (and (or (not .cse0) (not .cse1)) .cse2)))) (or (let ((.cse7 (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 ((.cse5 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse6 (fp.mul c_currentRoundingMode .cse5 (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 |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse4 .cse5)) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (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 .cse4 .cse7)) (fp.mul c_currentRoundingMode .cse4 .cse6)))))) .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 05:27:21,569 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (let ((.cse3 (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 (fp.mul c_currentRoundingMode .cse3 (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 .cse1 (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 |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (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)))))) (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 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse4) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2023-11-29 05:27:25,871 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (let ((.cse3 (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 (fp.mul c_currentRoundingMode .cse3 (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 .cse1 (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 |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (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)))))) (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 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse4) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2023-11-29 05:27:30,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (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 ((.cse12 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse9 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse12 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse9))))) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse7 (fp.mul c_currentRoundingMode .cse8 (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|)))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse10 .cse7)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse5 (fp.mul c_currentRoundingMode .cse10 .cse8)) (.cse13 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or .cse0 (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse12))) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse11))) (.cse1 (= (bvlshr .cse9 (_ bv1 32)) (_ bv0 32)))) (and (or .cse1 (fp.geq (fp.add c_currentRoundingMode .cse2 .cse3) (fp.add c_currentRoundingMode .cse4 .cse5))) (or (fp.geq (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse6 .cse7)) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 .cse8))) (not .cse1))))) (or (not .cse0) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse12)) .cse3) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse11)) .cse5))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse13) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse13 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~term~0#1| |c_ULTIMATE.start_main_~x~0#1|))))))) is different from false [2023-11-29 05:27:34,432 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse11 (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 ((.cse12 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse9 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse12 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse9))))) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse7 (fp.mul c_currentRoundingMode .cse8 (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|)))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse10 .cse7)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse5 (fp.mul c_currentRoundingMode .cse10 .cse8)) (.cse13 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or .cse0 (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse12))) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse11))) (.cse1 (= (bvlshr .cse9 (_ bv1 32)) (_ bv0 32)))) (and (or .cse1 (fp.geq (fp.add c_currentRoundingMode .cse2 .cse3) (fp.add c_currentRoundingMode .cse4 .cse5))) (or (fp.geq (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse6 .cse7)) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 .cse8))) (not .cse1))))) (or (not .cse0) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse12)) .cse3) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse11)) .cse5))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse13) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse13 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~term~0#1| |c_ULTIMATE.start_main_~x~0#1|))))))) is different from true [2023-11-29 05:27:38,607 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (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 ((.cse1 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.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))))) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |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 (_ bv3 32))))) (or .cse1 (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse2 .cse3)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse2 .cse4)))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (or (not .cse1) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse3)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse4))))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse2 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse6) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-11-29 05:27:42,868 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (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 ((.cse1 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.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))))) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |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 (_ bv3 32))))) (or .cse1 (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse2 .cse3)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse2 .cse4)))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (or (not .cse1) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse3)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse5 .cse4))))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse2 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse6) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-11-29 05:27:47,046 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~oddExp~0#1| |c_ULTIMATE.start_main_~evenExp~0#1|) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (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 .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.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.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|))))))) is different from false [2023-11-29 05:27:51,230 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) (and (let ((.cse10 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse10 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (.cse3 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse8 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse5 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (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| .cse3)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse9) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10))) .cse11) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| .cse9) (let ((.cse14 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse12)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse3)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse0 .cse14)) (fp.mul roundNearestTiesToEven .cse0 .cse13)))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10))))))) (not .cse11))) is different from false [2023-11-29 05:27:55,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:27:59,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:28:04,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:28:08,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:28:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:28:08,404 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2023-11-29 05:28:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:28:08,405 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 05:28:08,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:28:08,406 INFO L225 Difference]: With dead ends: 17 [2023-11-29 05:28:08,406 INFO L226 Difference]: Without dead ends: 13 [2023-11-29 05:28:08,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 113.5s TimeCoverageRelationStatistics Valid=41, Invalid=33, Unknown=24, NotChecked=322, Total=420 [2023-11-29 05:28:08,408 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:28:08,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 4 Unknown, 145 Unchecked, 17.2s Time] [2023-11-29 05:28:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-29 05:28:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-29 05:28:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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) [2023-11-29 05:28:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2023-11-29 05:28:08,414 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2023-11-29 05:28:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:28:08,414 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2023-11-29 05:28:08,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:28:08,415 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2023-11-29 05:28:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 05:28:08,415 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:28:08,416 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:28:08,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 05:28:08,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:28:08,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:28:08,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:28:08,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2097158245, now seen corresponding path program 2 times [2023-11-29 05:28:08,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:28:08,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230517968] [2023-11-29 05:28:08,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:28:08,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:28:08,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:28:08,619 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 05:28:08,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6f7cbf6-e1ed-4603-b39b-b4ea13e25fbe/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process