./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- 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-8393723 [2022-11-19 08:35:00,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:35:00,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:35:00,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:35:00,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:35:00,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:35:00,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:35:00,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:35:00,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:35:00,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:35:00,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:35:00,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:35:00,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:35:00,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:35:00,637 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:35:00,639 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:35:00,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:35:00,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:35:00,643 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:35:00,651 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:35:00,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:35:00,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:35:00,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:35:00,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:35:00,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:35:00,666 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:35:00,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:35:00,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:35:00,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:35:00,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:35:00,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:35:00,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:35:00,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:35:00,675 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:35:00,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:35:00,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:35:00,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:35:00,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:35:00,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:35:00,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:35:00,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:35:00,681 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 08:35:00,721 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:35:00,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:35:00,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:35:00,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:35:00,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:35:00,724 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:35:00,724 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:35:00,724 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:35:00,724 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:35:00,725 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 08:35:00,726 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:35:00,726 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:35:00,726 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 08:35:00,727 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 08:35:00,727 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:35:00,727 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 08:35:00,728 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 08:35:00,728 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 08:35:00,729 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:35:00,729 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:35:00,729 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 08:35:00,729 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:35:00,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:35:00,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:35:00,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:35:00,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:35:00,731 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:35:00,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:35:00,731 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:35:00,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:35:00,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:35:00,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:35:00,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:35:00,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:35:00,734 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 08:35:00,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:35:00,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:35:00,734 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 08:35:00,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 08:35:00,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:35:00,735 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:35:00,736 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2022-11-19 08:35:01,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:35:01,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:35:01,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:35:01,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:35:01,065 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:35:01,066 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2022-11-19 08:35:01,146 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data/af5883f7a/6722434ac50b448990ace106d7c8cbd9/FLAG6d14d21bf [2022-11-19 08:35:01,668 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:35:01,668 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2022-11-19 08:35:01,675 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data/af5883f7a/6722434ac50b448990ace106d7c8cbd9/FLAG6d14d21bf [2022-11-19 08:35:02,009 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data/af5883f7a/6722434ac50b448990ace106d7c8cbd9 [2022-11-19 08:35:02,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:35:02,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:35:02,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:35:02,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:35:02,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:35:02,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e16b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02, skipping insertion in model container [2022-11-19 08:35:02,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:35:02,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:35:02,283 WARN L234 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_dc6682b1-3fac-483b-9715-47158cd78913/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2022-11-19 08:35:02,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:35:02,309 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:35:02,319 WARN L234 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_dc6682b1-3fac-483b-9715-47158cd78913/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2022-11-19 08:35:02,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:35:02,335 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:35:02,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02 WrapperNode [2022-11-19 08:35:02,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:35:02,336 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:35:02,336 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:35:02,336 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:35:02,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,368 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-11-19 08:35:02,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:35:02,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:35:02,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:35:02,369 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:35:02,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,379 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,380 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,388 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:35:02,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:35:02,392 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:35:02,392 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:35:02,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (1/1) ... [2022-11-19 08:35:02,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:35:02,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:35:02,424 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:35:02,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:35:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:35:02,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 08:35:02,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:35:02,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:35:02,554 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:35:02,557 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:35:02,707 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:35:02,756 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:35:02,756 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 08:35:02,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:35:02 BoogieIcfgContainer [2022-11-19 08:35:02,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:35:02,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:35:02,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:35:02,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:35:02,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:35:02" (1/3) ... [2022-11-19 08:35:02,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433e01c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:35:02, skipping insertion in model container [2022-11-19 08:35:02,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:02" (2/3) ... [2022-11-19 08:35:02,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433e01c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:35:02, skipping insertion in model container [2022-11-19 08:35:02,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:35:02" (3/3) ... [2022-11-19 08:35:02,768 INFO L112 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2022-11-19 08:35:02,789 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:35:02,789 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 08:35:02,856 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:35:02,864 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@21b8ab3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:35:02,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 08:35:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:35:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-19 08:35:02,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:35:02,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-19 08:35:02,876 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:35:02,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:35:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash 73372351, now seen corresponding path program 1 times [2022-11-19 08:35:02,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:35:02,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242793015] [2022-11-19 08:35:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:35:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:35:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:35:03,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:35:03,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 08:35:03,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242793015] [2022-11-19 08:35:03,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242793015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:35:03,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:35:03,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:35:03,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151494181] [2022-11-19 08:35:03,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:35:03,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:35:03,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 08:35:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:35:03,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:35:03,124 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:35:03,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:35:03,172 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-11-19 08:35:03,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:35:03,175 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-19 08:35:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:35:03,183 INFO L225 Difference]: With dead ends: 15 [2022-11-19 08:35:03,194 INFO L226 Difference]: Without dead ends: 7 [2022-11-19 08:35:03,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:35:03,201 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 08:35:03,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:35:03,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-11-19 08:35:03,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-11-19 08:35:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:35:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-11-19 08:35:03,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-11-19 08:35:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:35:03,249 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-11-19 08:35:03,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:35:03,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-11-19 08:35:03,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-19 08:35:03,251 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:35:03,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-19 08:35:03,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 08:35:03,253 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:35:03,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:35:03,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2044617620, now seen corresponding path program 1 times [2022-11-19 08:35:03,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 08:35:03,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586776384] [2022-11-19 08:35:03,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:35:03,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 08:35:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:35:03,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 08:35:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 08:35:03,395 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 08:35:03,396 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 08:35:03,398 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-19 08:35:03,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 08:35:03,404 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-19 08:35:03,411 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 08:35:03,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:35:03 BoogieIcfgContainer [2022-11-19 08:35:03,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 08:35:03,446 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 08:35:03,446 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 08:35:03,446 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 08:35:03,447 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:35:02" (3/4) ... [2022-11-19 08:35:03,451 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 08:35:03,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 08:35:03,453 INFO L158 Benchmark]: Toolchain (without parser) took 1436.32ms. Allocated memory is still 132.1MB. Free memory was 99.1MB in the beginning and 68.6MB in the end (delta: 30.5MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-11-19 08:35:03,453 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 86.0MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:35:03,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.09ms. Allocated memory is still 132.1MB. Free memory was 99.1MB in the beginning and 108.4MB in the end (delta: -9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:35:03,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.21ms. Allocated memory is still 132.1MB. Free memory was 108.4MB in the beginning and 107.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:35:03,461 INFO L158 Benchmark]: Boogie Preprocessor took 21.90ms. Allocated memory is still 132.1MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 08:35:03,461 INFO L158 Benchmark]: RCFGBuilder took 366.64ms. Allocated memory is still 132.1MB. Free memory was 105.6MB in the beginning and 93.8MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 08:35:03,462 INFO L158 Benchmark]: TraceAbstraction took 683.42ms. Allocated memory is still 132.1MB. Free memory was 93.1MB in the beginning and 69.3MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-19 08:35:03,462 INFO L158 Benchmark]: Witness Printer took 5.45ms. Allocated memory is still 132.1MB. Free memory was 69.3MB in the beginning and 68.6MB in the end (delta: 691.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 08:35:03,470 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.28ms. Allocated memory is still 86.0MB. Free memory was 57.5MB in the beginning and 57.5MB in the end (delta: 29.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.09ms. Allocated memory is still 132.1MB. Free memory was 99.1MB in the beginning and 108.4MB in the end (delta: -9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.21ms. Allocated memory is still 132.1MB. Free memory was 108.4MB in the beginning and 107.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.90ms. Allocated memory is still 132.1MB. Free memory was 107.0MB in the beginning and 105.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 366.64ms. Allocated memory is still 132.1MB. Free memory was 105.6MB in the beginning and 93.8MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 683.42ms. Allocated memory is still 132.1MB. Free memory was 93.1MB in the beginning and 69.3MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 5.45ms. Allocated memory is still 132.1MB. Free memory was 69.3MB in the beginning and 68.6MB in the end (delta: 691.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 32. Possible FailurePath: [L14] float pi = 3.14159 ; [L20] float x = __VERIFIER_nondet_float() ; [L21] float octant = pi/3 ; [L22] CALL assume_abort_if_not(x > octant && x < pi) [L10] COND FALSE !(!cond) [L22] RET assume_abort_if_not(x > octant && x < pi) [L23] float oddExp = x ; [L24] float evenExp = 1.0 ; [L25] float term = x ; [L26] unsigned int count = 2 ; [L27] int multFactor = 0 ; [L28] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=52, pi=314159/100000, term=52, x=52] [L30] COND TRUE 1 [L32] term = term * (x/count) [L33] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L35] evenExp = evenExp + multFactor*term [L37] count++ [L39] term = term * (x/count) [L41] oddExp = oddExp + multFactor*term [L43] count++ [L45] temp = __VERIFIER_nondet_int() [L46] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=52] [L49] CALL __VERIFIER_assert( oddExp >= evenExp ) [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L12] reach_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 7 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 4 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-19 08:35:03,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- 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-8393723 [2022-11-19 08:35:05,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 08:35:05,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 08:35:05,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 08:35:05,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 08:35:05,896 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 08:35:05,898 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 08:35:05,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 08:35:05,904 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 08:35:05,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 08:35:05,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 08:35:05,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 08:35:05,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 08:35:05,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 08:35:05,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 08:35:05,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 08:35:05,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 08:35:05,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 08:35:05,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 08:35:05,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 08:35:05,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 08:35:05,940 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 08:35:05,942 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 08:35:05,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 08:35:05,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 08:35:05,950 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 08:35:05,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 08:35:05,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 08:35:05,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 08:35:05,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 08:35:05,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 08:35:05,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 08:35:05,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 08:35:05,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 08:35:05,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 08:35:05,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 08:35:05,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 08:35:05,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 08:35:05,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 08:35:05,962 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 08:35:05,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 08:35:05,968 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-19 08:35:06,009 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 08:35:06,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 08:35:06,010 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 08:35:06,010 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 08:35:06,011 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 08:35:06,011 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 08:35:06,011 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 08:35:06,011 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 08:35:06,012 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 08:35:06,012 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 08:35:06,013 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 08:35:06,013 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 08:35:06,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 08:35:06,015 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 08:35:06,015 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 08:35:06,015 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 08:35:06,015 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 08:35:06,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 08:35:06,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 08:35:06,016 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 08:35:06,016 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 08:35:06,016 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 08:35:06,016 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 08:35:06,016 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 08:35:06,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 08:35:06,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 08:35:06,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 08:35:06,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 08:35:06,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 08:35:06,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:35:06,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 08:35:06,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 08:35:06,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 08:35:06,019 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 08:35:06,019 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 08:35:06,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 08:35:06,019 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 08:35:06,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 08:35:06,020 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2022-11-19 08:35:06,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 08:35:06,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 08:35:06,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 08:35:06,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 08:35:06,430 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 08:35:06,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2022-11-19 08:35:06,499 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data/191c6b5d8/70b48a3726e845ea82b2d13640136957/FLAG680b8fc3e [2022-11-19 08:35:06,940 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 08:35:06,940 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2022-11-19 08:35:06,947 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data/191c6b5d8/70b48a3726e845ea82b2d13640136957/FLAG680b8fc3e [2022-11-19 08:35:07,331 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/data/191c6b5d8/70b48a3726e845ea82b2d13640136957 [2022-11-19 08:35:07,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 08:35:07,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 08:35:07,339 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 08:35:07,339 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 08:35:07,343 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 08:35:07,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ba2009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07, skipping insertion in model container [2022-11-19 08:35:07,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 08:35:07,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 08:35:07,553 WARN L234 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_dc6682b1-3fac-483b-9715-47158cd78913/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2022-11-19 08:35:07,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:35:07,584 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 08:35:07,622 WARN L234 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_dc6682b1-3fac-483b-9715-47158cd78913/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2022-11-19 08:35:07,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 08:35:07,666 INFO L208 MainTranslator]: Completed translation [2022-11-19 08:35:07,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07 WrapperNode [2022-11-19 08:35:07,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 08:35:07,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 08:35:07,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 08:35:07,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 08:35:07,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,700 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2022-11-19 08:35:07,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 08:35:07,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 08:35:07,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 08:35:07,701 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 08:35:07,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,724 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 08:35:07,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 08:35:07,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 08:35:07,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 08:35:07,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (1/1) ... [2022-11-19 08:35:07,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 08:35:07,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 08:35:07,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 08:35:07,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 08:35:07,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 08:35:07,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 08:35:07,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 08:35:07,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 08:35:07,896 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 08:35:07,898 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 08:35:10,949 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 08:35:10,956 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 08:35:10,956 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-19 08:35:10,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:35:10 BoogieIcfgContainer [2022-11-19 08:35:10,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 08:35:10,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 08:35:10,961 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 08:35:10,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 08:35:10,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:35:07" (1/3) ... [2022-11-19 08:35:10,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274222ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:35:10, skipping insertion in model container [2022-11-19 08:35:10,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:35:07" (2/3) ... [2022-11-19 08:35:10,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@274222ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:35:10, skipping insertion in model container [2022-11-19 08:35:10,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:35:10" (3/3) ... [2022-11-19 08:35:10,968 INFO L112 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2022-11-19 08:35:11,008 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 08:35:11,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 08:35:11,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 08:35:11,063 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@404b041d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 08:35:11,063 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 08:35:11,068 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:35:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-19 08:35:11,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:35:11,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:35:11,076 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:35:11,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:35:11,082 INFO L85 PathProgramCache]: Analyzing trace with hash 119513908, now seen corresponding path program 1 times [2022-11-19 08:35:11,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:35:11,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661269834] [2022-11-19 08:35:11,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:35:11,097 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-11-19 08:35:11,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:35:11,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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-11-19 08:35:11,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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-11-19 08:35:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:35:11,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 08:35:11,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:35:11,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:35:11,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:35:11,350 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:35:11,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661269834] [2022-11-19 08:35:11,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661269834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:35:11,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:35:11,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 08:35:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168349915] [2022-11-19 08:35:11,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:35:11,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 08:35:11,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:35:11,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 08:35:11,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 08:35:11,407 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:35:11,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:35:11,423 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-11-19 08:35:11,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 08:35:11,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-19 08:35:11,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:35:11,434 INFO L225 Difference]: With dead ends: 25 [2022-11-19 08:35:11,434 INFO L226 Difference]: Without dead ends: 10 [2022-11-19 08:35:11,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-11-19 08:35:11,452 INFO L413 NwaCegarLoop]: 14 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, 14 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-11-19 08:35:11,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 08:35:11,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-19 08:35:11,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-11-19 08:35:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:35:11,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-11-19 08:35:11,487 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2022-11-19 08:35:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:35:11,487 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-11-19 08:35:11,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:35:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-11-19 08:35:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-19 08:35:11,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:35:11,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:35:11,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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-11-19 08:35:11,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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-11-19 08:35:11,704 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:35:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:35:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1186636597, now seen corresponding path program 1 times [2022-11-19 08:35:11,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:35:11,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196542123] [2022-11-19 08:35:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:35:11,706 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-11-19 08:35:11,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:35:11,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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-11-19 08:35:11,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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-11-19 08:35:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:35:24,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 08:35:24,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:36:08,237 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from false [2022-11-19 08:36:10,302 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) |c_ULTIMATE.start_main_~evenExp~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2)))) is different from true [2022-11-19 08:37:01,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (.cse2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (let ((.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse2)))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse0 .cse1)))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse5) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse6))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| .cse5) (not (let ((.cse7 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse4)))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse2)))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse0 .cse7))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse6))))))) is different from false [2022-11-19 08:37:18,518 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from false [2022-11-19 08:37:20,580 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from true [2022-11-19 08:37:20,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 08:37:20,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 08:37:20,581 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:37:20,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196542123] [2022-11-19 08:37:20,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196542123] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 08:37:20,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 08:37:20,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 08:37:20,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713043403] [2022-11-19 08:37:20,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 08:37:20,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 08:37:20,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 08:37:20,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 08:37:20,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=21, Unknown=5, NotChecked=30, Total=72 [2022-11-19 08:37:20,585 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:37:36,440 WARN L233 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 26 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:37:48,685 WARN L233 SmtUtils]: Spent 9.58s on a formula simplification. DAG size of input: 38 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 08:37:51,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-19 08:37:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 08:37:51,502 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-19 08:37:51,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 08:37:51,733 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-19 08:37:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 08:37:51,734 INFO L225 Difference]: With dead ends: 16 [2022-11-19 08:37:51,734 INFO L226 Difference]: Without dead ends: 12 [2022-11-19 08:37:51,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 53.2s TimeCoverageRelationStatistics Valid=34, Invalid=45, Unknown=5, NotChecked=48, Total=132 [2022-11-19 08:37:51,736 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-19 08:37:51,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 7 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 17 Unchecked, 4.2s Time] [2022-11-19 08:37:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-19 08:37:51,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-19 08:37:51,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:37:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-19 08:37:51,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-11-19 08:37:51,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 08:37:51,743 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-19 08:37:51,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 08:37:51,743 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-19 08:37:51,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 08:37:51,744 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 08:37:51,744 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 08:37:51,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-11-19 08:37:51,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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-11-19 08:37:51,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 08:37:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 08:37:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2054856368, now seen corresponding path program 1 times [2022-11-19 08:37:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 08:37:51,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693139725] [2022-11-19 08:37:51,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:37:51,947 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-11-19 08:37:51,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 08:37:51,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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-11-19 08:37:51,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/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-11-19 08:39:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:39:03,088 WARN L261 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-19 08:39:03,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:39:39,204 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:39:48,556 WARN L233 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:39:53,961 WARN L233 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:39:59,451 WARN L233 SmtUtils]: Spent 5.49s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:40:08,442 WARN L233 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:40:18,470 WARN L233 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:40:20,667 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv4294967294 32)))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse2) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-19 08:40:27,328 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:40:37,144 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:40:42,469 WARN L233 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:40:47,759 WARN L233 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:40:57,569 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:41:18,862 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from false [2022-11-19 08:41:20,995 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|)))))) is different from true [2022-11-19 08:42:15,062 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (let ((.cse9 (fp.div roundNearestTiesToEven .cse10 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (.cse3 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))) (.cse7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))) (.cse8 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))) (or (and (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (not (let ((.cse5 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse3)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| .cse9) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| .cse9) (let ((.cse13 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse8)))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse7)))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse6)))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse11)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| .cse3)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse0 .cse13)) (fp.mul roundNearestTiesToEven .cse0 .cse12)))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse10))))))) is different from false [2022-11-19 08:42:33,474 WARN L837 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from false [2022-11-19 08:42:35,589 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from true [2022-11-19 08:42:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-19 08:42:35,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:42:55,605 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from false [2022-11-19 08:42:57,751 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32))))))) (and (or .cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse3))))) (or (not .cse0) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse2)) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse4 .cse3)))))))) is different from true [2022-11-19 08:43:20,845 WARN L233 SmtUtils]: Spent 5.31s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:43:30,568 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:43:40,307 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:43:45,544 WARN L233 SmtUtils]: Spent 5.23s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:43:50,727 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:43:56,262 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse12 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse9 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse12 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse9))))) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse7 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse10 .cse7)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse5 (fp.mul c_currentRoundingMode .cse10 .cse8))) (and (or .cse0 (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse12))) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse11))) (.cse1 (= (bvlshr .cse9 (_ bv1 32)) (_ bv0 32)))) (and (or .cse1 (fp.geq (fp.add c_currentRoundingMode .cse2 .cse3) (fp.add c_currentRoundingMode .cse4 .cse5))) (or (fp.geq (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse6 .cse7)) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 .cse8))) (not .cse1))))) (or (not .cse0) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse12)) .cse3) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse11)) .cse5))))))))) is different from false [2022-11-19 08:43:58,585 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse11 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse12 (fp.mul c_currentRoundingMode .cse11 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))))) (.cse9 (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse12 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode .cse9))))) (let ((.cse10 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse7 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 (= (_ bv0 32) (bvlshr |c_ULTIMATE.start_main_~count~0#1| (_ bv1 32)))) (.cse3 (fp.mul c_currentRoundingMode .cse10 .cse7)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32))) (.cse5 (fp.mul c_currentRoundingMode .cse10 .cse8))) (and (or .cse0 (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse12))) (.cse4 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse10 .cse11))) (.cse1 (= (bvlshr .cse9 (_ bv1 32)) (_ bv0 32)))) (and (or .cse1 (fp.geq (fp.add c_currentRoundingMode .cse2 .cse3) (fp.add c_currentRoundingMode .cse4 .cse5))) (or (fp.geq (fp.add c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse6 .cse7)) (fp.add c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 .cse8))) (not .cse1))))) (or (not .cse0) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse12)) .cse3) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse6 .cse11)) .cse5))))))))) is different from true [2022-11-19 08:44:05,198 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from false [2022-11-19 08:44:07,400 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from true [2022-11-19 08:44:18,945 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from false [2022-11-19 08:44:21,153 WARN L859 $PredicateComparison]: unable to prove that (or (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) is different from true [2022-11-19 08:44:26,188 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:44:31,285 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:44:36,631 WARN L233 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:44:39,651 WARN L859 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_5| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_5| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32))))) (let ((.cse3 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_5| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_5| c_~pi~0)))) is different from true [2022-11-19 08:44:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-19 08:44:39,652 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 08:44:39,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693139725] [2022-11-19 08:44:39,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693139725] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 08:44:39,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1870816222] [2022-11-19 08:44:39,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 08:44:39,653 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-19 08:44:39,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/cvc4 [2022-11-19 08:44:39,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-19 08:44:39,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dc6682b1-3fac-483b-9715-47158cd78913/bin/utaipan-I9t0OCRTmS/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2022-11-19 08:46:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 08:46:19,218 WARN L261 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-19 08:46:19,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 08:46:40,637 WARN L233 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:46:45,887 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:46:51,430 WARN L233 SmtUtils]: Spent 5.54s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:46:56,951 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:47:07,135 WARN L233 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:47:09,286 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~term~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse1 .cse0)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse2) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-19 08:47:21,214 WARN L233 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:47:26,490 WARN L233 SmtUtils]: Spent 5.27s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:47:32,039 WARN L233 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:47:37,564 WARN L233 SmtUtils]: Spent 5.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:47:47,764 WARN L233 SmtUtils]: Spent 5.55s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:47:52,796 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:49:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-19 08:49:16,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 08:49:52,802 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification. DAG size of input: 7 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:49:57,958 WARN L233 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:50:06,311 WARN L233 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:50:11,478 WARN L233 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:50:16,734 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-19 08:50:26,585 WARN L233 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)