./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/bary_diverge.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- 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-13 16:55:24,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:55:24,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:55:24,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:55:24,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:55:24,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:55:24,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:55:24,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:55:24,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:55:24,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:55:24,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:55:24,167 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:55:24,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:55:24,168 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:55:24,169 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:55:24,170 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:55:24,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:55:24,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:55:24,172 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:55:24,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:55:24,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:55:24,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:55:24,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:55:24,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:55:24,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:55:24,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:55:24,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:55:24,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:55:24,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:55:24,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:55:24,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:55:24,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:55:24,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:55:24,181 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:55:24,182 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:55:24,182 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:55:24,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:55:24,183 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:55:24,183 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:55:24,183 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:55:24,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:55:24,184 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 16:55:24,198 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:55:24,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:55:24,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:55:24,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:55:24,198 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:55:24,199 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:55:24,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:55:24,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:55:24,199 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:55:24,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:55:24,199 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:55:24,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:55:24,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:55:24,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:55:24,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:55:24,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:55:24,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:55:24,200 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:55:24,200 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:55:24,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:55:24,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:55:24,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:55:24,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:55:24,201 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:55:24,202 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:55:24,202 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:55:24,202 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2022-12-13 16:55:24,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:55:24,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:55:24,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:55:24,386 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:55:24,386 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:55:24,387 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/bary_diverge.c [2022-12-13 16:55:26,946 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:55:27,102 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:55:27,102 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/sv-benchmarks/c/float-benchs/bary_diverge.c [2022-12-13 16:55:27,107 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/data/25aafef9e/a878ca578d9049b692e8449c639822e9/FLAGc41016ead [2022-12-13 16:55:27,516 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/data/25aafef9e/a878ca578d9049b692e8449c639822e9 [2022-12-13 16:55:27,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:55:27,519 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:55:27,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:55:27,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:55:27,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:55:27,523 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45bf166f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27, skipping insertion in model container [2022-12-13 16:55:27,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:55:27,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:55:27,647 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_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2022-12-13 16:55:27,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:55:27,668 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:55:27,677 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_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2022-12-13 16:55:27,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:55:27,690 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:55:27,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27 WrapperNode [2022-12-13 16:55:27,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:55:27,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:55:27,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:55:27,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:55:27,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,715 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 69 [2022-12-13 16:55:27,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:55:27,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:55:27,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:55:27,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:55:27,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,729 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:55:27,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:55:27,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:55:27,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:55:27,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (1/1) ... [2022-12-13 16:55:27,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:55:27,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:55:27,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:55:27,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:55:27,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:55:27,790 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2022-12-13 16:55:27,790 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2022-12-13 16:55:27,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:55:27,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:55:27,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:55:27,855 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:55:27,856 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:55:27,924 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:55:27,929 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:55:27,929 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 16:55:27,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:55:27 BoogieIcfgContainer [2022-12-13 16:55:27,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:55:27,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:55:27,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:55:27,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:55:27,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:55:27" (1/3) ... [2022-12-13 16:55:27,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a65a065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:55:27, skipping insertion in model container [2022-12-13 16:55:27,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:27" (2/3) ... [2022-12-13 16:55:27,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a65a065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:55:27, skipping insertion in model container [2022-12-13 16:55:27,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:55:27" (3/3) ... [2022-12-13 16:55:27,937 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2022-12-13 16:55:27,953 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:55:27,953 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:55:27,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:55:27,994 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@17f13aaf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:55:27,994 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:55:27,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 16:55:28,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 16:55:28,003 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:28,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:28,003 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:28,007 INFO L85 PathProgramCache]: Analyzing trace with hash 372835822, now seen corresponding path program 1 times [2022-12-13 16:55:28,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:28,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656969151] [2022-12-13 16:55:28,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:28,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 16:55:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-12-13 16:55:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:55:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:55:28,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656969151] [2022-12-13 16:55:28,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656969151] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:28,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:28,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:55:28,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13716401] [2022-12-13 16:55:28,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:28,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:55:28,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:55:28,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:55:28,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:55:28,169 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 16:55:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:28,185 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-12-13 16:55:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:55:28,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-12-13 16:55:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:28,192 INFO L225 Difference]: With dead ends: 61 [2022-12-13 16:55:28,192 INFO L226 Difference]: Without dead ends: 28 [2022-12-13 16:55:28,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-13 16:55:28,196 INFO L413 NwaCegarLoop]: 38 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, 38 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-13 16:55:28,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:55:28,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-13 16:55:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-13 16:55:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 16:55:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-12-13 16:55:28,232 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2022-12-13 16:55:28,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:28,232 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-12-13 16:55:28,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 16:55:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-12-13 16:55:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 16:55:28,233 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:28,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:28,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:55:28,234 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:28,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash -920244306, now seen corresponding path program 1 times [2022-12-13 16:55:28,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:55:28,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366787678] [2022-12-13 16:55:28,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:28,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:55:28,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:55:28,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 16:55:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 16:55:28,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 16:55:28,302 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 16:55:28,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 16:55:28,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:55:28,307 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 16:55:28,309 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 16:55:28,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 04:55:28 BoogieIcfgContainer [2022-12-13 16:55:28,329 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 16:55:28,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 16:55:28,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 16:55:28,330 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 16:55:28,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:55:27" (3/4) ... [2022-12-13 16:55:28,333 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 16:55:28,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 16:55:28,334 INFO L158 Benchmark]: Toolchain (without parser) took 815.23ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 92.2MB in the beginning and 121.6MB in the end (delta: -29.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:55:28,334 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory was 90.7MB in the beginning and 90.7MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:55:28,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.31ms. Allocated memory is still 127.9MB. Free memory was 92.2MB in the beginning and 81.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 16:55:28,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.03ms. Allocated memory is still 127.9MB. Free memory was 81.7MB in the beginning and 80.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 16:55:28,336 INFO L158 Benchmark]: Boogie Preprocessor took 15.15ms. Allocated memory is still 127.9MB. Free memory was 80.2MB in the beginning and 79.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:55:28,336 INFO L158 Benchmark]: RCFGBuilder took 199.33ms. Allocated memory is still 127.9MB. Free memory was 78.7MB in the beginning and 68.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 16:55:28,337 INFO L158 Benchmark]: TraceAbstraction took 397.00ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 67.6MB in the beginning and 121.6MB in the end (delta: -54.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:55:28,337 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 155.2MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 16:55:28,339 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.14ms. Allocated memory is still 127.9MB. Free memory was 90.7MB in the beginning and 90.7MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.31ms. Allocated memory is still 127.9MB. Free memory was 92.2MB in the beginning and 81.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.03ms. Allocated memory is still 127.9MB. Free memory was 81.7MB in the beginning and 80.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.15ms. Allocated memory is still 127.9MB. Free memory was 80.2MB in the beginning and 79.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 199.33ms. Allocated memory is still 127.9MB. Free memory was 78.7MB in the beginning and 68.2MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 397.00ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 67.6MB in the beginning and 121.6MB in the end (delta: -54.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 155.2MB. Free memory is still 121.6MB. 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: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 50. Possible FailurePath: [L19] BOOLEAN INIT; [L20] float C1, I; [L34] static float X,Y,Z; VAL [C1=0, I=0, INIT=0, X=0, Y=0, Z=0] [L55] int i; [L57] INIT = TRUE VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L58] CALL, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [\old(cond)=1, C1=0, cond=1, I=0, INIT=1, X=0, Y=0, Z=0] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; VAL [\result=54, C1=0, I=0, INIT=1, X=0, x=54, Y=0, Z=0] [L58] RET, EXPR RANDOM_INPUT() VAL [C1=0, I=0, INIT=1, RANDOM_INPUT()=54, X=0, Y=0, Z=0] [L58] C1 = RANDOM_INPUT() [L59] CALL, EXPR RANDOM_INPUT() VAL [C1=54, I=0, INIT=1, X=0, Y=0, Z=0] [L24] float x; [L25] x = __VERIFIER_nondet_float() [L26] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L12] COND FALSE !(!cond) VAL [\old(cond)=1, C1=54, cond=1, I=0, INIT=1, X=0, Y=0, Z=0] [L26] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L27] return x; VAL [\result=53, C1=54, I=0, INIT=1, X=0, x=53, Y=0, Z=0] [L59] RET, EXPR RANDOM_INPUT() VAL [C1=54, I=0, INIT=1, RANDOM_INPUT()=53, X=0, Y=0, Z=0] [L59] I = RANDOM_INPUT() [L61] i = 0 VAL [C1=54, i=0, I=53, INIT=1, X=0, Y=0, Z=0] [L61] COND TRUE i < 3600000 [L62] CALL bary() [L36] COND TRUE C1 > 0.f [L37] Z = Y [L38] Y = X VAL [C1=54, I=53, INIT=1, X=0, Y=0, Z=0] [L41] COND TRUE INIT == TRUE [L42] X = I [L43] Y = I [L44] Z = I VAL [C1=54, I=53, INIT=1, X=53, Y=53, Z=53] [L50] CALL __VERIFIER_assert(X >= -5.f && X <= 5.f) [L14] COND TRUE !(cond) VAL [\old(cond)=0, C1=54, cond=0, I=53, INIT=1, X=53, Y=53, Z=53] [L14] reach_error() VAL [\old(cond)=0, C1=54, cond=0, I=53, INIT=1, X=53, Y=53, Z=53] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 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, 38 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 38 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 5/5 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-13 16:55:28,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/bary_diverge.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 --- 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-13 16:55:30,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:55:30,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:55:30,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:55:30,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:55:30,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:55:30,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:55:30,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:55:30,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:55:30,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:55:30,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:55:30,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:55:30,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:55:30,113 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:55:30,114 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:55:30,115 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:55:30,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:55:30,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:55:30,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:55:30,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:55:30,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:55:30,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:55:30,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:55:30,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:55:30,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:55:30,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:55:30,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:55:30,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:55:30,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:55:30,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:55:30,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:55:30,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:55:30,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:55:30,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:55:30,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:55:30,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:55:30,140 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:55:30,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:55:30,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:55:30,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:55:30,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:55:30,142 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 16:55:30,159 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:55:30,159 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:55:30,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:55:30,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:55:30,160 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:55:30,160 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:55:30,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:55:30,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:55:30,161 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:55:30,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:55:30,161 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:55:30,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:55:30,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:55:30,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 16:55:30,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:55:30,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 16:55:30,162 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:55:30,162 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 16:55:30,162 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 16:55:30,162 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:55:30,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 16:55:30,163 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:55:30,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 16:55:30,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:55:30,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:55:30,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:55:30,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:55:30,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:55:30,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:55:30,164 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 16:55:30,164 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 16:55:30,165 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 16:55:30,165 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:55:30,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 16:55:30,165 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:55:30,165 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:55:30,165 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 16:55:30,165 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:55:30,166 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9d207296596aa3375527680ff88bb2bc1830663ee47f0fb08df7239383517f9 [2022-12-13 16:55:30,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:55:30,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:55:30,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:55:30,407 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:55:30,407 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:55:30,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/bary_diverge.c [2022-12-13 16:55:32,956 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:55:33,142 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:55:33,143 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/sv-benchmarks/c/float-benchs/bary_diverge.c [2022-12-13 16:55:33,148 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/data/dc4a5edba/092282cc4d5641da85895a88adffdd0a/FLAG8b4f051e9 [2022-12-13 16:55:33,159 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/data/dc4a5edba/092282cc4d5641da85895a88adffdd0a [2022-12-13 16:55:33,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:55:33,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:55:33,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:55:33,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:55:33,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:55:33,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45795aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33, skipping insertion in model container [2022-12-13 16:55:33,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:55:33,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:55:33,287 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_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2022-12-13 16:55:33,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:55:33,311 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:55:33,320 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_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/sv-benchmarks/c/float-benchs/bary_diverge.c[632,645] [2022-12-13 16:55:33,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:55:33,336 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:55:33,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33 WrapperNode [2022-12-13 16:55:33,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:55:33,337 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:55:33,337 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:55:33,337 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:55:33,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,349 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,361 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 70 [2022-12-13 16:55:33,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:55:33,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:55:33,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:55:33,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:55:33,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,378 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:55:33,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:55:33,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:55:33,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:55:33,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (1/1) ... [2022-12-13 16:55:33,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:55:33,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:55:33,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:55:33,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:55:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:55:33,438 INFO L130 BoogieDeclarations]: Found specification of procedure RANDOM_INPUT [2022-12-13 16:55:33,438 INFO L138 BoogieDeclarations]: Found implementation of procedure RANDOM_INPUT [2022-12-13 16:55:33,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 16:55:33,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:55:33,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:55:33,534 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:55:33,536 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:55:35,689 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:55:35,693 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:55:35,693 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 16:55:35,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:55:35 BoogieIcfgContainer [2022-12-13 16:55:35,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:55:35,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:55:35,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:55:35,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:55:35,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:55:33" (1/3) ... [2022-12-13 16:55:35,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176d4d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:55:35, skipping insertion in model container [2022-12-13 16:55:35,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:55:33" (2/3) ... [2022-12-13 16:55:35,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@176d4d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:55:35, skipping insertion in model container [2022-12-13 16:55:35,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:55:35" (3/3) ... [2022-12-13 16:55:35,700 INFO L112 eAbstractionObserver]: Analyzing ICFG bary_diverge.c [2022-12-13 16:55:35,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:55:35,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 16:55:35,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:55:35,752 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@4a12b2e2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:55:35,752 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 16:55:35,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 16:55:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 16:55:35,761 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:35,761 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:35,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:35,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash 372835822, now seen corresponding path program 1 times [2022-12-13 16:55:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:55:35,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190421671] [2022-12-13 16:55:35,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:35,775 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-13 16:55:35,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:55:35,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:35,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:35,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:35,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 16:55:35,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:55:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 16:55:35,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:55:35,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:55:35,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190421671] [2022-12-13 16:55:35,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190421671] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:35,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:35,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:55:35,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985926424] [2022-12-13 16:55:35,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:35,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 16:55:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:55:35,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 16:55:35,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 16:55:35,897 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 16:55:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:35,913 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-12-13 16:55:35,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 16:55:35,914 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-12-13 16:55:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:35,919 INFO L225 Difference]: With dead ends: 61 [2022-12-13 16:55:35,919 INFO L226 Difference]: Without dead ends: 28 [2022-12-13 16:55:35,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-13 16:55:35,923 INFO L413 NwaCegarLoop]: 38 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, 38 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-13 16:55:35,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:55:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-13 16:55:35,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-13 16:55:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 16:55:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-12-13 16:55:35,953 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2022-12-13 16:55:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:35,954 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-12-13 16:55:35,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 16:55:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-12-13 16:55:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 16:55:35,955 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:35,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:35,965 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:36,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:36,158 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash -920244306, now seen corresponding path program 1 times [2022-12-13 16:55:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:55:36,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142211370] [2022-12-13 16:55:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:36,163 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-13 16:55:36,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:55:36,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:36,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:36,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 16:55:36,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:55:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 16:55:36,797 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:55:36,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:55:36,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142211370] [2022-12-13 16:55:36,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142211370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:36,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:36,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:55:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181406568] [2022-12-13 16:55:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:36,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:55:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:55:36,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:55:36,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:55:36,801 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:55:39,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:55:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:40,034 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-12-13 16:55:40,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 16:55:40,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-12-13 16:55:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:40,036 INFO L225 Difference]: With dead ends: 54 [2022-12-13 16:55:40,036 INFO L226 Difference]: Without dead ends: 52 [2022-12-13 16:55:40,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-12-13 16:55:40,038 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 58 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:40,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 190 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 136 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-12-13 16:55:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-13 16:55:40,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-12-13 16:55:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 35 states have internal predecessors, (39), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:55:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-12-13 16:55:40,049 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 22 [2022-12-13 16:55:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:40,049 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-12-13 16:55:40,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 16:55:40,050 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-12-13 16:55:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 16:55:40,050 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:40,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:40,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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)] Forceful destruction successful, exit code 0 [2022-12-13 16:55:40,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:40,252 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:40,255 INFO L85 PathProgramCache]: Analyzing trace with hash -920184724, now seen corresponding path program 1 times [2022-12-13 16:55:40,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:55:40,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265974301] [2022-12-13 16:55:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:40,259 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-13 16:55:40,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:55:40,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:40,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:40,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 16:55:40,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:55:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 16:55:40,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:55:40,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:55:40,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265974301] [2022-12-13 16:55:40,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265974301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:40,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:40,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:55:40,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897838322] [2022-12-13 16:55:40,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:40,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:55:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:55:40,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:55:40,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:55:40,557 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 16:55:42,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:55:42,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:42,925 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-12-13 16:55:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:55:42,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 22 [2022-12-13 16:55:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:42,949 INFO L225 Difference]: With dead ends: 85 [2022-12-13 16:55:42,949 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 16:55:42,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:55:42,950 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:42,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-12-13 16:55:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 16:55:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-12-13 16:55:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 16:55:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2022-12-13 16:55:42,958 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 22 [2022-12-13 16:55:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:42,958 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2022-12-13 16:55:42,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-13 16:55:42,958 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2022-12-13 16:55:42,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 16:55:42,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:42,959 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:42,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 16:55:43,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:43,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash -961441789, now seen corresponding path program 1 times [2022-12-13 16:55:43,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:55:43,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455064115] [2022-12-13 16:55:43,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:43,162 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-13 16:55:43,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:55:43,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:43,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 16:55:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:43,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 16:55:43,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:55:43,646 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 16:55:43,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 16:55:43,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 16:55:43,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455064115] [2022-12-13 16:55:43,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455064115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:55:43,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:55:43,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 16:55:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615554086] [2022-12-13 16:55:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:55:43,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 16:55:43,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 16:55:43,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 16:55:43,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 16:55:43,649 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 16:55:46,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:55:48,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:55:50,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:55:52,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:55:54,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:55:56,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:55:58,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 16:55:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:55:59,105 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-12-13 16:55:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 16:55:59,106 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-12-13 16:55:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:55:59,107 INFO L225 Difference]: With dead ends: 85 [2022-12-13 16:55:59,108 INFO L226 Difference]: Without dead ends: 83 [2022-12-13 16:55:59,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2022-12-13 16:55:59,109 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 72 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 25 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:55:59,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 231 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 179 Invalid, 6 Unknown, 0 Unchecked, 14.4s Time] [2022-12-13 16:55:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-12-13 16:55:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2022-12-13 16:55:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 43 states have internal predecessors, (46), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 16:55:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-12-13 16:55:59,119 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 52 [2022-12-13 16:55:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:55:59,120 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-12-13 16:55:59,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-13 16:55:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-12-13 16:55:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 16:55:59,121 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:55:59,121 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:55:59,130 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 16:55:59,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:59,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 16:55:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:55:59,326 INFO L85 PathProgramCache]: Analyzing trace with hash -961382207, now seen corresponding path program 1 times [2022-12-13 16:55:59,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 16:55:59,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186416671] [2022-12-13 16:55:59,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:55:59,329 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-13 16:55:59,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 16:55:59,333 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 16:55:59,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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 (6)] Waiting until timeout for monitored process [2022-12-13 16:55:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:55:59,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 16:55:59,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:56:41,688 WARN L233 SmtUtils]: Spent 8.76s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 16:57:18,619 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 (fp.neg .cse2)) (.cse4 (fp.neg .cse0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)))) (and (fp.leq ~Z~0 .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3) (fp.geq ~Z~0 .cse4))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse2)) (fp.leq ~Z~0 .cse0) (fp.geq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse5 ~Z~0) (fp.mul roundNearestTiesToEven .cse6 ~Z~0)) (fp.mul roundNearestTiesToEven .cse7 ~Z~0)) .cse3)) (fp.geq ~Z~0 .cse4)))))))) is different from false [2022-12-13 16:57:37,840 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from false [2022-12-13 16:57:39,853 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from true [2022-12-13 16:57:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2022-12-13 16:57:39,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:57:53,874 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-12-13 16:57:55,905 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-12-13 16:58:06,137 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-12-13 16:58:08,164 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-12-13 17:00:00,115 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-12-13 17:00:24,906 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-12-13 17:00:26,932 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-12-13 17:00:50,819 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_9| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_9|) (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_#t~ret6#1_9|)) .cse5))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_9| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_9|) (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.neg .cse5))))))) is different from false [2022-12-13 17:00:52,869 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse5 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_9| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_9|) (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_#t~ret6#1_9|)) .cse5))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_9| (_ FloatingPoint 8 24))) (or (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_9| .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_9|) (fp.mul c_currentRoundingMode .cse3 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_#t~ret6#1_9|)) (fp.neg .cse5))))))) is different from true [2022-12-13 17:00:52,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 17:00:52,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186416671] [2022-12-13 17:00:52,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186416671] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:00:52,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1521948904] [2022-12-13 17:00:52,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:00:52,871 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-12-13 17:00:52,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/cvc4 [2022-12-13 17:00:52,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-12-13 17:00:52,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-12-13 17:00:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:00:54,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 17:00:54,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:01:29,639 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) is different from false [2022-12-13 17:01:46,474 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 1 not checked. [2022-12-13 17:01:46,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:03:46,997 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from false [2022-12-13 17:03:49,025 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from true [2022-12-13 17:04:07,472 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq c_~X~0 .cse2)) (not (fp.geq c_~X~0 .cse1))))) is different from false [2022-12-13 17:04:09,501 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.leq c_~X~0 .cse2)) (not (fp.geq c_~X~0 .cse1))))) is different from true [2022-12-13 17:04:26,810 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_~I~0 .cse1)) (not (fp.leq c_~I~0 .cse2))))) is different from false [2022-12-13 17:04:28,839 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse1 (fp.neg .cse2))) (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~I~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~I~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~I~0)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_~I~0 .cse1)) (not (fp.leq c_~I~0 .cse2))))) is different from true [2022-12-13 17:05:12,820 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse0 (fp.neg .cse2))) (or (not (fp.geq |c_ULTIMATE.start_main_#t~ret6#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.leq |c_ULTIMATE.start_main_#t~ret6#1| .cse2))))) is different from false [2022-12-13 17:05:14,849 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (let ((.cse0 (fp.neg .cse2))) (or (not (fp.geq |c_ULTIMATE.start_main_#t~ret6#1| .cse0)) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) |c_ULTIMATE.start_main_#t~ret6#1|)))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (fp.leq |c_ULTIMATE.start_main_#t~ret6#1| .cse2))))) is different from true [2022-12-13 17:05:48,407 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 5.0)) (.cse5 (fp.neg .cse4))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_12| (_ FloatingPoint 8 24))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_12|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.neg .cse3)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_12| (_ FloatingPoint 8 24))) (or (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_12|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_12|)) .cse3) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse5))))))) is different from false [2022-12-13 17:05:50,460 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 5.0)) (.cse5 (fp.neg .cse4))) (and (forall ((|v_ULTIMATE.start_main_#t~ret6#1_12| (_ FloatingPoint 8 24))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_12|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.neg .cse3)) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~ret6#1_12| (_ FloatingPoint 8 24))) (or (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_#t~ret6#1_12|) (fp.mul c_currentRoundingMode .cse1 |v_ULTIMATE.start_main_#t~ret6#1_12|)) (fp.mul c_currentRoundingMode .cse2 |v_ULTIMATE.start_main_#t~ret6#1_12|)) .cse3) (not (fp.leq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse4)) (not (fp.geq |v_ULTIMATE.start_main_#t~ret6#1_12| .cse5))))))) is different from true [2022-12-13 17:05:50,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1521948904] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 17:05:50,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 17:05:50,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 13 [2022-12-13 17:05:50,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266090077] [2022-12-13 17:05:50,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 17:05:50,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 17:05:50,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 17:05:50,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 17:05:50,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=135, Unknown=33, NotChecked=468, Total=702 [2022-12-13 17:05:50,462 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:05:52,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:05:56,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:05:58,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:00,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:04,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:09,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:13,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:15,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:17,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:19,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:21,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:25,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:27,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:29,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:31,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:33,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:35,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:40,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:42,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:44,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:46,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:48,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:50,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:52,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:54,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:56,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:06:58,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:00,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:02,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:06,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:08,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:10,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:12,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:14,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:16,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:17,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:07:19,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:07:21,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:07:24,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:26,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:28,637 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse9 (fp.neg .cse4)) (.cse10 (fp.neg .cse5))) (let ((.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (.cse7 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (.cse6 (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 ~Z~0) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.mul roundNearestTiesToEven .cse3 ~Z~0)) .cse9)) (fp.geq ~Z~0 .cse10))))) (and (or .cse0 (and (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 ~Z~0) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.mul roundNearestTiesToEven .cse3 ~Z~0)) .cse4)) (fp.leq ~Z~0 .cse5))) .cse6) .cse7)) (or (and .cse0 (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse8 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 ~Z~0) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.mul roundNearestTiesToEven .cse3 ~Z~0)))) (and (fp.leq ~Z~0 .cse5) (fp.leq .cse8 .cse4) (fp.geq .cse8 .cse9) (fp.geq ~Z~0 .cse10))))) (and .cse7 (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 ~Z~0) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.mul roundNearestTiesToEven .cse3 ~Z~0)) .cse4)) (fp.leq ~Z~0 .cse5) (fp.geq ~Z~0 .cse10))) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2022-12-13 17:07:30,653 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 5.0))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse9 (fp.neg .cse4)) (.cse10 (fp.neg .cse5))) (let ((.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (.cse7 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (.cse6 (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 ~Z~0) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.mul roundNearestTiesToEven .cse3 ~Z~0)) .cse9)) (fp.geq ~Z~0 .cse10))))) (and (or .cse0 (and (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 ~Z~0) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.mul roundNearestTiesToEven .cse3 ~Z~0)) .cse4)) (fp.leq ~Z~0 .cse5))) .cse6) .cse7)) (or (and .cse0 (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse8 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 ~Z~0) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.mul roundNearestTiesToEven .cse3 ~Z~0)))) (and (fp.leq ~Z~0 .cse5) (fp.leq .cse8 .cse4) (fp.geq .cse8 .cse9) (fp.geq ~Z~0 .cse10))))) (and .cse7 (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 ~Z~0) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.mul roundNearestTiesToEven .cse3 ~Z~0)) .cse4)) (fp.leq ~Z~0 .cse5) (fp.geq ~Z~0 .cse10))) .cse6))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2022-12-13 17:07:32,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:34,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:36,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:38,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:45,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:47,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:49,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:51,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:53,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:55,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:57,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:07:59,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:01,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:03,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:05,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:07,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:09,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:11,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:13,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:15,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:08:17,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:08:19,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:21,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:23,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:25,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:08:27,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:08:29,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-13 17:08:31,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 17:08:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:08:31,971 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2022-12-13 17:08:31,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 17:08:31,971 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-12-13 17:08:31,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:08:31,972 INFO L225 Difference]: With dead ends: 125 [2022-12-13 17:08:31,973 INFO L226 Difference]: Without dead ends: 123 [2022-12-13 17:08:31,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 114.3s TimeCoverageRelationStatistics Valid=151, Invalid=367, Unknown=44, NotChecked=770, Total=1332 [2022-12-13 17:08:31,974 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 79 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 32 mSolverCounterUnsat, 66 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 137.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 66 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 137.8s IncrementalHoareTripleChecker+Time [2022-12-13 17:08:31,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 231 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 161 Invalid, 66 Unknown, 146 Unchecked, 137.8s Time] [2022-12-13 17:08:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-13 17:08:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 82. [2022-12-13 17:08:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.09375) internal successors, (70), 65 states have internal predecessors, (70), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-12-13 17:08:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2022-12-13 17:08:31,984 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 52 [2022-12-13 17:08:31,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:08:31,984 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2022-12-13 17:08:31,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 13 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 17:08:31,984 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2022-12-13 17:08:31,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-12-13 17:08:31,985 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:08:31,986 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:08:31,992 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-12-13 17:08:32,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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 (6)] Ended with exit code 0 [2022-12-13 17:08:32,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 17:08:32,388 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 17:08:32,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:08:32,389 INFO L85 PathProgramCache]: Analyzing trace with hash -77572522, now seen corresponding path program 2 times [2022-12-13 17:08:32,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 17:08:32,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923366253] [2022-12-13 17:08:32,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 17:08:32,390 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-13 17:08:32,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 17:08:32,391 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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-13 17:08:32,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8f36dc5a-8d63-40c6-86c0-074f3bfaa676/bin/uautomizer-uyxdKDjOR8/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 (8)] Waiting until timeout for monitored process [2022-12-13 17:08:32,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 17:08:32,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 17:08:32,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 17:08:32,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 17:08:44,696 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((~Z~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (fp.geq ~Z~0 (fp.neg .cse0)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) ~Z~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) ~Z~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) ~Z~0)) c_~X~0) (fp.leq ~Z~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-12-13 17:09:10,453 WARN L837 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) is different from false [2022-12-13 17:09:30,381 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from false [2022-12-13 17:09:32,398 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 50000001.0 100000000.0))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (/ 30000001.0 100000000.0))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 20000001.0 100000000.0))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven 5.0)) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 1.0))) (or (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) .cse3)) (fp.leq ~Z~0 .cse4))) (exists ((~Z~0 (_ FloatingPoint 8 24))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 ~Z~0) (fp.mul roundNearestTiesToEven .cse1 ~Z~0)) (fp.mul roundNearestTiesToEven .cse2 ~Z~0)) (fp.neg .cse3))) (fp.geq ~Z~0 (fp.neg .cse4)))))) is different from true [2022-12-13 17:09:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 94 proven. 18 refuted. 0 times theorem prover too weak. 49 trivial. 4 not checked. [2022-12-13 17:09:32,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 17:09:42,814 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-12-13 17:09:44,847 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~Y~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Z~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-12-13 17:09:55,121 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-12-13 17:09:57,154 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 50000001.0 100000000.0)) c_~X~0) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 30000001.0 100000000.0)) c_~X~0)) (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 20000001.0 100000000.0)) c_~Y~0))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 5.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true