./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 06:21:05,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:21:05,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:21:05,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:21:05,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:21:05,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:21:05,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:21:05,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:21:05,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:21:05,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:21:05,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:21:05,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:21:05,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:21:05,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:21:05,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:21:05,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:21:05,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:21:05,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:21:05,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:21:05,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:21:05,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:21:05,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:21:05,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:21:05,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:21:05,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:21:05,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:21:05,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:21:05,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:21:05,054 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:21:05,055 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:21:05,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:21:05,056 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:21:05,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:21:05,057 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:21:05,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:21:05,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:21:05,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:21:05,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:21:05,059 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:21:05,060 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:21:05,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:21:05,061 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 06:21:05,085 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:21:05,085 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:21:05,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:21:05,086 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:21:05,086 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:21:05,086 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:21:05,086 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:21:05,087 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:21:05,087 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:21:05,087 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:21:05,087 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:21:05,087 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:21:05,087 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:21:05,087 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:21:05,087 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:21:05,088 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:21:05,088 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:21:05,088 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:21:05,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:21:05,088 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:21:05,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:21:05,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:21:05,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:21:05,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:21:05,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:21:05,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:21:05,089 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:21:05,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:21:05,089 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:21:05,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:21:05,090 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:21:05,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:21:05,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:21:05,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:21:05,090 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:21:05,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:21:05,090 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:21:05,091 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:21:05,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:21:05,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:21:05,091 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:21:05,091 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2022-12-14 06:21:05,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:21:05,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:21:05,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:21:05,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:21:05,278 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:21:05,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2022-12-14 06:21:07,840 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:21:07,990 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:21:07,991 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2022-12-14 06:21:07,995 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/data/8255bc3ab/e6d97669e33d48a3a7bc833508b3841d/FLAG5bf443405 [2022-12-14 06:21:08,418 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/data/8255bc3ab/e6d97669e33d48a3a7bc833508b3841d [2022-12-14 06:21:08,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:21:08,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:21:08,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:21:08,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:21:08,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:21:08,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5cf88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08, skipping insertion in model container [2022-12-14 06:21:08,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,433 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:21:08,445 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:21:08,557 WARN L237 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_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2022-12-14 06:21:08,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:21:08,573 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:21:08,581 WARN L237 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_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2022-12-14 06:21:08,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:21:08,593 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:21:08,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08 WrapperNode [2022-12-14 06:21:08,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:21:08,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:21:08,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:21:08,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:21:08,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,615 INFO L138 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2022-12-14 06:21:08,616 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:21:08,616 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:21:08,616 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:21:08,616 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:21:08,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,628 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:21:08,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:21:08,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:21:08,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:21:08,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (1/1) ... [2022-12-14 06:21:08,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:21:08,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:21:08,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:21:08,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:21:08,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:21:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 06:21:08,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 06:21:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 06:21:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:21:08,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:21:08,727 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:21:08,728 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:21:08,797 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:21:08,811 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:21:08,812 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 06:21:08,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:21:08 BoogieIcfgContainer [2022-12-14 06:21:08,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:21:08,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:21:08,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:21:08,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:21:08,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:21:08" (1/3) ... [2022-12-14 06:21:08,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1976dc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:21:08, skipping insertion in model container [2022-12-14 06:21:08,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:08" (2/3) ... [2022-12-14 06:21:08,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1976dc38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:21:08, skipping insertion in model container [2022-12-14 06:21:08,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:21:08" (3/3) ... [2022-12-14 06:21:08,822 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2022-12-14 06:21:08,837 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:21:08,838 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 06:21:08,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:21:08,877 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@289d325c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:21:08,877 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 06:21:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:21:08,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 06:21:08,885 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:08,885 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:08,885 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:21:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1415755698, now seen corresponding path program 1 times [2022-12-14 06:21:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:08,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638744311] [2022-12-14 06:21:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:08,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:08,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:21:08,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:21:09,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638744311] [2022-12-14 06:21:09,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638744311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:09,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:09,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:21:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829848453] [2022-12-14 06:21:09,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 06:21:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:21:09,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 06:21:09,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 06:21:09,048 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:21:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:09,067 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-12-14 06:21:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 06:21:09,069 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 12 [2022-12-14 06:21:09,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:09,073 INFO L225 Difference]: With dead ends: 20 [2022-12-14 06:21:09,074 INFO L226 Difference]: Without dead ends: 12 [2022-12-14 06:21:09,076 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 [2022-12-14 06:21:09,078 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:09,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:21:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-12-14 06:21:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-14 06:21:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:21:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-12-14 06:21:09,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 12 [2022-12-14 06:21:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:09,104 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-12-14 06:21:09,104 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:21:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-12-14 06:21:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 06:21:09,105 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:09,105 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:09,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:21:09,106 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:21:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:09,106 INFO L85 PathProgramCache]: Analyzing trace with hash 900707654, now seen corresponding path program 1 times [2022-12-14 06:21:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:21:09,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591389774] [2022-12-14 06:21:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:21:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:21:09,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 06:21:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:21:09,150 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 06:21:09,151 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 06:21:09,152 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 06:21:09,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 06:21:09,156 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-14 06:21:09,158 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 06:21:09,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 06:21:09 BoogieIcfgContainer [2022-12-14 06:21:09,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 06:21:09,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 06:21:09,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 06:21:09,173 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 06:21:09,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:21:08" (3/4) ... [2022-12-14 06:21:09,175 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 06:21:09,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 06:21:09,176 INFO L158 Benchmark]: Toolchain (without parser) took 753.47ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 80.8MB in the beginning and 97.4MB in the end (delta: -16.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2022-12-14 06:21:09,176 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:21:09,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.56ms. Allocated memory is still 113.2MB. Free memory was 80.8MB in the beginning and 70.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 06:21:09,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.63ms. Allocated memory is still 113.2MB. Free memory was 70.5MB in the beginning and 69.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:21:09,177 INFO L158 Benchmark]: Boogie Preprocessor took 13.59ms. Allocated memory is still 113.2MB. Free memory was 69.1MB in the beginning and 67.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:21:09,177 INFO L158 Benchmark]: RCFGBuilder took 183.20ms. Allocated memory is still 113.2MB. Free memory was 67.8MB in the beginning and 57.4MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 06:21:09,178 INFO L158 Benchmark]: TraceAbstraction took 356.39ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 56.7MB in the beginning and 97.8MB in the end (delta: -41.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:21:09,178 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 136.3MB. Free memory was 97.8MB in the beginning and 97.4MB in the end (delta: 335.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:21:09,180 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.56ms. Allocated memory is still 113.2MB. Free memory was 80.8MB in the beginning and 70.5MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.63ms. Allocated memory is still 113.2MB. Free memory was 70.5MB in the beginning and 69.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.59ms. Allocated memory is still 113.2MB. Free memory was 69.1MB in the beginning and 67.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 183.20ms. Allocated memory is still 113.2MB. Free memory was 67.8MB in the beginning and 57.4MB in the end (delta: 10.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 356.39ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 56.7MB in the beginning and 97.8MB in the end (delta: -41.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 136.3MB. Free memory was 97.8MB in the beginning and 97.4MB in the end (delta: 335.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 22, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryArithmeticFLOAToperation at line 31. Possible FailurePath: [L20] float x = __VERIFIER_nondet_float() ; [L21] CALL assume_abort_if_not(x > -1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) [L21] RET assume_abort_if_not(x > -1.0) [L22] CALL assume_abort_if_not(x < 1.0) VAL [\old(cond)=1] [L11] COND FALSE !(!cond) [L22] RET assume_abort_if_not(x < 1.0) [L23] float exp = 1.0 ; [L24] float term = 1.0 ; [L25] unsigned int count = 1 ; [L26] float result = 2*(1/(1-x)) ; [L27] int temp ; VAL [count=1, exp=1, term=1] [L29] COND TRUE 1 [L31] term = term * (x/count) [L32] exp = exp + term [L33] count++ [L35] temp = __VERIFIER_nondet_int() [L36] COND TRUE temp ==0 VAL [count=2, temp=0] [L39] CALL __VERIFIER_assert( result >= exp ) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 2, 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, 12 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 12 mSDtfsCounter, 3 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=14occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 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 [2022-12-14 06:21:09,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 06:21:10,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:21:10,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:21:10,734 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:21:10,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:21:10,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:21:10,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:21:10,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:21:10,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:21:10,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:21:10,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:21:10,742 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:21:10,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:21:10,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:21:10,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:21:10,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:21:10,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:21:10,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:21:10,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:21:10,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:21:10,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:21:10,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:21:10,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:21:10,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:21:10,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:21:10,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:21:10,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:21:10,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:21:10,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:21:10,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:21:10,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:21:10,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:21:10,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:21:10,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:21:10,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:21:10,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:21:10,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:21:10,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:21:10,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:21:10,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:21:10,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:21:10,775 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-12-14 06:21:10,797 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:21:10,798 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:21:10,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:21:10,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:21:10,799 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:21:10,799 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:21:10,799 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:21:10,799 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:21:10,800 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:21:10,800 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:21:10,800 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:21:10,800 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:21:10,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:21:10,801 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:21:10,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:21:10,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:21:10,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:21:10,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:21:10,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:21:10,802 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 06:21:10,802 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 06:21:10,802 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 06:21:10,803 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:21:10,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:21:10,803 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:21:10,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:21:10,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:21:10,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 06:21:10,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:21:10,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:21:10,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:21:10,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:21:10,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:21:10,805 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 06:21:10,805 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 06:21:10,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:21:10,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:21:10,806 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 06:21:10,806 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 259166f87cdd7847094aaf95c1b6c2506a27351f8fceb58c6f5bc2db5fb43f03 [2022-12-14 06:21:11,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:21:11,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:21:11,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:21:11,031 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:21:11,031 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:21:11,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2022-12-14 06:21:13,608 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:21:13,726 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:21:13,727 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2022-12-14 06:21:13,731 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/data/098d15990/d0a248dc1f104f7dbc8e8a74183fc089/FLAG66e9a5670 [2022-12-14 06:21:13,742 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/data/098d15990/d0a248dc1f104f7dbc8e8a74183fc089 [2022-12-14 06:21:13,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:21:13,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:21:13,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:21:13,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:21:13,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:21:13,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:13,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65303784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13, skipping insertion in model container [2022-12-14 06:21:13,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:13,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:21:13,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:21:13,894 WARN L237 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_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2022-12-14 06:21:13,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:21:13,924 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:21:13,937 WARN L237 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_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c[497,510] [2022-12-14 06:21:13,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:21:13,950 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:21:13,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13 WrapperNode [2022-12-14 06:21:13,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:21:13,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:21:13,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:21:13,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:21:13,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:13,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:13,988 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2022-12-14 06:21:13,989 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:21:13,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:21:13,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:21:13,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:21:13,996 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:13,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:13,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:13,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:14,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:14,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:14,010 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:14,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:14,014 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:21:14,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:21:14,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:21:14,015 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:21:14,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (1/1) ... [2022-12-14 06:21:14,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:21:14,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:21:14,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:21:14,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:21:14,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:21:14,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 06:21:14,078 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 06:21:14,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 06:21:14,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:21:14,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:21:14,131 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:21:14,133 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:21:16,650 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:21:16,655 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:21:16,655 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 06:21:16,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:21:16 BoogieIcfgContainer [2022-12-14 06:21:16,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:21:16,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:21:16,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:21:16,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:21:16,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:21:13" (1/3) ... [2022-12-14 06:21:16,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248d523f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:21:16, skipping insertion in model container [2022-12-14 06:21:16,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:21:13" (2/3) ... [2022-12-14 06:21:16,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248d523f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:21:16, skipping insertion in model container [2022-12-14 06:21:16,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:21:16" (3/3) ... [2022-12-14 06:21:16,663 INFO L112 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2022-12-14 06:21:16,677 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:21:16,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 06:21:16,712 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:21:16,717 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@352119f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:21:16,717 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 06:21:16,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:21:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 06:21:16,726 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:16,726 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:16,727 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:21:16,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:16,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1019803906, now seen corresponding path program 1 times [2022-12-14 06:21:16,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:21:16,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284189839] [2022-12-14 06:21:16,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:16,740 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 [2022-12-14 06:21:16,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:21:16,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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) [2022-12-14 06:21:16,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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 [2022-12-14 06:21:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:16,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-14 06:21:16,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:21:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 06:21:17,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:21:17,005 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:21:17,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284189839] [2022-12-14 06:21:17,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284189839] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:21:17,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:21:17,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 06:21:17,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481056868] [2022-12-14 06:21:17,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:21:17,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-14 06:21:17,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:21:17,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-14 06:21:17,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 06:21:17,033 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:21:17,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:21:17,046 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-12-14 06:21:17,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-14 06:21:17,048 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-12-14 06:21:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:21:17,052 INFO L225 Difference]: With dead ends: 35 [2022-12-14 06:21:17,052 INFO L226 Difference]: Without dead ends: 15 [2022-12-14 06:21:17,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-14 06:21:17,057 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:21:17,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:21:17,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-12-14 06:21:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-12-14 06:21:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:21:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-12-14 06:21:17,081 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 17 [2022-12-14 06:21:17,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:21:17,081 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-12-14 06:21:17,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-14 06:21:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-12-14 06:21:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 06:21:17,082 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:21:17,082 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:21:17,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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 [2022-12-14 06:21:17,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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 [2022-12-14 06:21:17,284 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:21:17,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:21:17,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1211444824, now seen corresponding path program 1 times [2022-12-14 06:21:17,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:21:17,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165662473] [2022-12-14 06:21:17,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:21:17,290 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 [2022-12-14 06:21:17,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:21:17,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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) [2022-12-14 06:21:17,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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 [2022-12-14 06:21:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:21:18,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-14 06:21:18,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:22:12,270 WARN L233 SmtUtils]: Spent 21.04s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 06:22:29,333 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse2 .cse1)))) is different from false [2022-12-14 06:22:31,371 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse2 (fp.neg .cse1)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse2 .cse1)))) is different from true [2022-12-14 06:23:17,811 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (.cse5 ((_ to_fp 8 24) roundNearestTiesToEven .cse2)) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.gt .cse0 .cse1) (fp.lt .cse0 .cse2) (not (fp.geq (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6))))))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.gt .cse7 .cse1) (fp.lt .cse7 .cse2) (fp.geq (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6))))))))))) is different from false [2022-12-14 06:23:34,555 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from false [2022-12-14 06:23:36,598 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))))))) is different from true [2022-12-14 06:23:36,599 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 06:23:36,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:23:36,599 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:23:36,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165662473] [2022-12-14 06:23:36,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165662473] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:23:36,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:23:36,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-14 06:23:36,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993509845] [2022-12-14 06:23:36,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:23:36,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-14 06:23:36,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 06:23:36,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-14 06:23:36,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=34, Unknown=7, NotChecked=42, Total=110 [2022-12-14 06:23:36,602 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:23:42,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 06:23:44,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-14 06:23:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:23:44,661 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-12-14 06:23:44,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 06:23:44,762 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-12-14 06:23:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:23:44,763 INFO L225 Difference]: With dead ends: 21 [2022-12-14 06:23:44,763 INFO L226 Difference]: Without dead ends: 17 [2022-12-14 06:23:44,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 42.0s TimeCoverageRelationStatistics Valid=32, Invalid=44, Unknown=8, NotChecked=48, Total=132 [2022-12-14 06:23:44,765 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-12-14 06:23:44,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 34 Unchecked, 5.8s Time] [2022-12-14 06:23:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-12-14 06:23:44,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-12-14 06:23:44,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:23:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-12-14 06:23:44,769 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 18 [2022-12-14 06:23:44,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:23:44,770 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-12-14 06:23:44,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 06:23:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-12-14 06:23:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-14 06:23:44,771 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:23:44,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:23:44,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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 [2022-12-14 06:23:44,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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 [2022-12-14 06:23:44,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:23:44,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:23:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 311013171, now seen corresponding path program 1 times [2022-12-14 06:23:44,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 06:23:44,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75711518] [2022-12-14 06:23:44,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:23:44,980 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 [2022-12-14 06:23:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 06:23:44,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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) [2022-12-14 06:23:44,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/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 [2022-12-14 06:23:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:23:49,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 06:23:49,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:24:16,126 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|))) (and (= |c_ULTIMATE.start_main_~exp~0#1| .cse0) (= |c_ULTIMATE.start_main_~term~0#1| .cse0) (= |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|))))) (fp.gt .cse2 (fp.neg .cse3)) (fp.lt .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-12-14 06:24:47,486 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|))) (and (= |c_ULTIMATE.start_main_~exp~0#1| (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|))))) (fp.gt .cse2 (fp.neg .cse3)) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |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 (_ bv1 32))))) (fp.lt .cse2 .cse3) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-12-14 06:25:36,144 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse2))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse3 (fp.neg .cse2)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse3 .cse2)))) is different from false [2022-12-14 06:25:38,195 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse2))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))) |c_ULTIMATE.start_main_~exp~0#1|) (fp.gt .cse3 (fp.neg .cse2)) (= |c_ULTIMATE.start_main_~result~0#1| (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~x~0#1|))))) (fp.lt .cse3 .cse2)))) is different from true [2022-12-14 06:26:26,930 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 (fp.neg .cse8)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32))) (.cse4 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven .cse8)) (.cse5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.geq (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4))))) (fp.gt .cse6 .cse7) (fp.lt .cse6 .cse8)))) (= |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))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|))) (and (fp.gt .cse9 .cse7) (not (fp.geq (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~x~0#1|))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse5)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse10) (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))))) (fp.lt .cse9 .cse8)))))))) is different from false [2022-12-14 06:26:43,853 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))) (fp.lt .cse0 .cse1)))) is different from false [2022-12-14 06:26:45,908 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))))) (fp.lt .cse0 .cse1)))) is different from true [2022-12-14 06:26:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-12-14 06:26:45,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:26:52,564 WARN L837 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (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|))))) is different from false [2022-12-14 06:26:54,623 WARN L859 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| (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|))))) is different from true [2022-12-14 06:27:05,136 WARN L837 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| .cse0) (fp.mul c_currentRoundingMode .cse0 (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)))))))) is different from false [2022-12-14 06:27:07,258 WARN L859 $PredicateComparison]: unable to prove that (fp.geq |c_ULTIMATE.start_main_~result~0#1| (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~exp~0#1| .cse0) (fp.mul c_currentRoundingMode .cse0 (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)))))))) is different from true [2022-12-14 06:27:13,505 WARN L837 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from false [2022-12-14 06:27:15,586 WARN L859 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from true [2022-12-14 06:27:27,108 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from false [2022-12-14 06:27:29,197 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1|) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x~0#1|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from true [2022-12-14 06:27:39,802 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|) .cse3)))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2022-12-14 06:27:58,888 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|) .cse3)))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2022-12-14 06:28:14,781 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.gt .cse0 (fp.neg .cse1)))))) is different from false [2022-12-14 06:28:16,868 WARN L859 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~x~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 |ULTIMATE.start_main_~x~0#1|)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.gt .cse0 (fp.neg .cse1)))))) is different from true [2022-12-14 06:28:16,869 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 06:28:16,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75711518] [2022-12-14 06:28:16,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75711518] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:28:16,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [714254038] [2022-12-14 06:28:16,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:28:16,870 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-14 06:28:16,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/cvc4 [2022-12-14 06:28:16,871 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-14 06:28:16,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-12-14 06:28:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:28:18,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-14 06:28:18,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:30:58,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-12-14 06:30:58,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:31:35,101 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|) .cse0) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2022-12-14 06:31:54,218 WARN L859 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.lt ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|) .cse0) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) (= (_ bv0 32) c_assume_abort_if_not_~cond) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from true [2022-12-14 06:32:08,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [714254038] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:32:08,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106364881] [2022-12-14 06:32:08,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:32:08,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:32:08,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:32:08,256 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:32:08,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_312ee28b-8ba9-445f-9a1d-bb8f02f9132a/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 06:33:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:33:39,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-14 06:33:39,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:36:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-12-14 06:36:16,781 INFO L328 TraceCheckSpWp]: Computing backward predicates...