./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P --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 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:15:06,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:15:06,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:15:06,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:15:06,907 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:15:06,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:15:06,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:15:06,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:15:06,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:15:06,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:15:06,925 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:15:06,927 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:15:06,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:15:06,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:15:06,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:15:06,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:15:06,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:15:06,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:15:06,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:15:06,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:15:06,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:15:06,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:15:06,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:15:06,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:15:06,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:15:06,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:15:06,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:15:06,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:15:06,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:15:06,970 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:15:06,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:15:06,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:15:06,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:15:06,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:15:06,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:15:06,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:15:06,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:15:06,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:15:06,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:15:06,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:15:06,979 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:15:06,981 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 00:15:07,027 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:15:07,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:15:07,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:15:07,030 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:15:07,036 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:15:07,037 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:15:07,037 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:15:07,037 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:15:07,038 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:15:07,038 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:15:07,039 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:15:07,039 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:15:07,039 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:15:07,039 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:15:07,040 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:15:07,040 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:15:07,040 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:15:07,040 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:15:07,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:15:07,042 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:15:07,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:15:07,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:15:07,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:15:07,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:15:07,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:15:07,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:15:07,043 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:15:07,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:15:07,044 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:15:07,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:15:07,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:15:07,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:15:07,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:15:07,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:15:07,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:15:07,046 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:15:07,046 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:15:07,046 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:15:07,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:15:07,046 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:15:07,047 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:15:07,047 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/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_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P 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 -> 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d [2021-11-21 00:15:07,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:15:07,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:15:07,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:15:07,386 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:15:07,387 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:15:07,388 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2021-11-21 00:15:07,459 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data/90f1bded9/7c3b16ba53f047ec86e6318c06b6b66b/FLAGaf7b4a43d [2021-11-21 00:15:07,999 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:15:08,000 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2021-11-21 00:15:08,011 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data/90f1bded9/7c3b16ba53f047ec86e6318c06b6b66b/FLAGaf7b4a43d [2021-11-21 00:15:08,383 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data/90f1bded9/7c3b16ba53f047ec86e6318c06b6b66b [2021-11-21 00:15:08,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:15:08,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:15:08,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:15:08,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:15:08,416 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:15:08,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2917581c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08, skipping insertion in model container [2021-11-21 00:15:08,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:15:08,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:15:08,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2021-11-21 00:15:08,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:15:08,666 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:15:08,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2021-11-21 00:15:08,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:15:08,703 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:15:08,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08 WrapperNode [2021-11-21 00:15:08,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:15:08,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:15:08,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:15:08,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:15:08,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,737 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2021-11-21 00:15:08,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:15:08,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:15:08,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:15:08,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:15:08,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:15:08,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:15:08,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:15:08,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:15:08,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (1/1) ... [2021-11-21 00:15:08,784 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:15:08,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:15:08,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:15:08,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:15:08,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:15:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:15:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:15:08,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:15:08,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-21 00:15:08,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-21 00:15:08,927 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:15:08,929 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:15:09,063 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:15:09,095 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:15:09,095 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 00:15:09,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:15:09 BoogieIcfgContainer [2021-11-21 00:15:09,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:15:09,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:15:09,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:15:09,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:15:09,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:15:08" (1/3) ... [2021-11-21 00:15:09,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5639f97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:15:09, skipping insertion in model container [2021-11-21 00:15:09,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:08" (2/3) ... [2021-11-21 00:15:09,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5639f97e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:15:09, skipping insertion in model container [2021-11-21 00:15:09,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:15:09" (3/3) ... [2021-11-21 00:15:09,108 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound5.c [2021-11-21 00:15:09,113 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:15:09,113 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:15:09,174 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:15:09,183 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 00:15:09,183 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:15:09,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 8 states have (on average 1.5) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:15:09,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:15:09,219 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:15:09,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:15:09,220 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:15:09,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:15:09,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1843522412, now seen corresponding path program 1 times [2021-11-21 00:15:09,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:15:09,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216949320] [2021-11-21 00:15:09,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:15:09,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:15:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:15:09,339 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 00:15:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:15:09,389 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-21 00:15:09,392 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 00:15:09,394 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 00:15:09,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:15:09,400 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-11-21 00:15:09,403 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 00:15:09,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 12:15:09 BoogieIcfgContainer [2021-11-21 00:15:09,426 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 00:15:09,429 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 00:15:09,429 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 00:15:09,429 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 00:15:09,430 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:15:09" (3/4) ... [2021-11-21 00:15:09,433 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 00:15:09,433 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 00:15:09,435 INFO L158 Benchmark]: Toolchain (without parser) took 1043.75ms. Allocated memory is still 138.4MB. Free memory was 104.3MB in the beginning and 85.5MB in the end (delta: 18.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2021-11-21 00:15:09,436 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 90.2MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:15:09,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.35ms. Allocated memory is still 138.4MB. Free memory was 104.3MB in the beginning and 111.4MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 00:15:09,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.51ms. Allocated memory is still 138.4MB. Free memory was 111.4MB in the beginning and 109.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:15:09,438 INFO L158 Benchmark]: Boogie Preprocessor took 34.91ms. Allocated memory is still 138.4MB. Free memory was 109.8MB in the beginning and 108.9MB in the end (delta: 853.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:15:09,443 INFO L158 Benchmark]: RCFGBuilder took 322.84ms. Allocated memory is still 138.4MB. Free memory was 108.9MB in the beginning and 99.3MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 00:15:09,444 INFO L158 Benchmark]: TraceAbstraction took 324.09ms. Allocated memory is still 138.4MB. Free memory was 98.7MB in the beginning and 86.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-21 00:15:09,446 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 138.4MB. Free memory was 86.1MB in the beginning and 85.5MB in the end (delta: 502.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:15:09,453 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.26ms. Allocated memory is still 90.2MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.35ms. Allocated memory is still 138.4MB. Free memory was 104.3MB in the beginning and 111.4MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.51ms. Allocated memory is still 138.4MB. Free memory was 111.4MB in the beginning and 109.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.91ms. Allocated memory is still 138.4MB. Free memory was 109.8MB in the beginning and 108.9MB in the end (delta: 853.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 322.84ms. Allocated memory is still 138.4MB. Free memory was 108.9MB in the beginning and 99.3MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 324.09ms. Allocated memory is still 138.4MB. Free memory was 98.7MB in the beginning and 86.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 138.4MB. Free memory was 86.1MB in the beginning and 85.5MB in the end (delta: 502.9kB). Peak memory consumption was 2.1MB. 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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=5) [L14] COND FALSE !(!cond) [L28] RET assume_abort_if_not(a>=0 && a<=5) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-21 00:15:09,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P --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 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:15:11,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:15:11,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:15:11,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:15:11,915 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:15:11,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:15:11,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:15:11,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:15:11,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:15:11,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:15:11,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:15:11,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:15:11,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:15:11,929 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:15:11,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:15:11,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:15:11,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:15:11,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:15:11,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:15:11,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:15:11,941 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:15:11,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:15:11,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:15:11,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:15:11,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:15:11,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:15:11,950 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:15:11,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:15:11,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:15:11,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:15:11,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:15:11,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:15:11,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:15:11,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:15:11,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:15:11,958 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:15:11,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:15:11,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:15:11,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:15:11,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:15:11,961 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:15:11,962 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 00:15:11,994 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:15:11,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:15:11,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:15:11,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:15:11,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:15:11,996 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:15:11,997 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:15:11,997 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:15:11,997 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:15:11,997 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:15:11,998 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:15:11,998 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:15:11,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:15:11,999 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:15:11,999 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:15:11,999 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:15:11,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:15:12,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:15:12,000 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:15:12,000 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 00:15:12,000 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 00:15:12,001 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:15:12,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:15:12,001 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:15:12,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:15:12,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:15:12,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 00:15:12,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:15:12,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:15:12,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:15:12,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:15:12,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:15:12,003 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 00:15:12,004 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 00:15:12,004 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:15:12,004 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:15:12,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:15:12,004 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_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/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_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P 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 -> 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d [2021-11-21 00:15:12,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:15:12,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:15:12,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:15:12,419 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:15:12,420 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:15:12,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2021-11-21 00:15:12,498 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data/7d753f7da/8dfad57c157e47f2a1b5d2267db173bb/FLAG701e251a9 [2021-11-21 00:15:13,072 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:15:13,074 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2021-11-21 00:15:13,081 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data/7d753f7da/8dfad57c157e47f2a1b5d2267db173bb/FLAG701e251a9 [2021-11-21 00:15:13,439 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/data/7d753f7da/8dfad57c157e47f2a1b5d2267db173bb [2021-11-21 00:15:13,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:15:13,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:15:13,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:15:13,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:15:13,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:15:13,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@154e3432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13, skipping insertion in model container [2021-11-21 00:15:13,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:15:13,486 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:15:13,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2021-11-21 00:15:13,655 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:15:13,666 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:15:13,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2021-11-21 00:15:13,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:15:13,698 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:15:13,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13 WrapperNode [2021-11-21 00:15:13,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:15:13,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:15:13,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:15:13,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:15:13,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,778 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2021-11-21 00:15:13,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:15:13,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:15:13,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:15:13,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:15:13,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:15:13,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:15:13,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:15:13,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:15:13,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (1/1) ... [2021-11-21 00:15:13,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:15:13,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:15:13,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:15:13,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:15:13,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:15:13,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 00:15:13,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:15:13,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:15:13,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-21 00:15:13,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-21 00:15:13,969 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:15:13,971 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:15:15,269 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:15:15,275 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:15:15,275 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 00:15:15,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:15:15 BoogieIcfgContainer [2021-11-21 00:15:15,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:15:15,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:15:15,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:15:15,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:15:15,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:15:13" (1/3) ... [2021-11-21 00:15:15,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32321eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:15:15, skipping insertion in model container [2021-11-21 00:15:15,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:15:13" (2/3) ... [2021-11-21 00:15:15,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32321eda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:15:15, skipping insertion in model container [2021-11-21 00:15:15,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:15:15" (3/3) ... [2021-11-21 00:15:15,290 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound5.c [2021-11-21 00:15:15,304 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:15:15,304 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:15:15,344 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:15:15,351 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-11-21 00:15:15,351 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:15:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:15:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-21 00:15:15,371 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:15:15,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:15:15,372 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:15:15,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:15:15,378 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-11-21 00:15:15,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:15:15,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236664365] [2021-11-21 00:15:15,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:15:15,392 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:15:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:15:15,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:15:15,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 00:15:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:15:15,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-21 00:15:15,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:15:16,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:15:16,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:15:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:15:16,100 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:15:16,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236664365] [2021-11-21 00:15:16,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236664365] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:15:16,102 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:15:16,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:15:16,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353626662] [2021-11-21 00:15:16,104 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:15:16,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 00:15:16,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:15:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 00:15:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:15:16,132 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:15:16,150 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-11-21 00:15:16,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 00:15:16,152 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-21 00:15:16,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:15:16,158 INFO L225 Difference]: With dead ends: 33 [2021-11-21 00:15:16,158 INFO L226 Difference]: Without dead ends: 14 [2021-11-21 00:15:16,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:15:16,164 INFO L933 BasicCegarLoop]: 19 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, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:15:16,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:15:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-21 00:15:16,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-21 00:15:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:15:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-21 00:15:16,199 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-11-21 00:15:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:15:16,199 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-21 00:15:16,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:15:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-11-21 00:15:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-21 00:15:16,201 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:15:16,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:15:16,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:15:16,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:15:16,421 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:15:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:15:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-11-21 00:15:16,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:15:16,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439752652] [2021-11-21 00:15:16,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:15:16,424 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:15:16,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:15:16,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:15:16,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 00:15:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:15:17,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-21 00:15:17,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:15:28,550 WARN L227 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 00:16:26,377 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and .cse1 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (not .cse1) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))))) is different from false [2021-11-21 00:16:28,408 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (let ((.cse1 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and .cse1 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (not .cse1) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))))) is different from true [2021-11-21 00:17:07,240 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse0) (= c___VERIFIER_assert_~cond (_ bv0 32))) (and .cse0 (= c___VERIFIER_assert_~cond (_ bv1 32))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1)))) is different from false [2021-11-21 00:17:09,273 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse0) (= c___VERIFIER_assert_~cond (_ bv0 32))) (and .cse0 (= c___VERIFIER_assert_~cond (_ bv1 32))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1)))) is different from true [2021-11-21 00:17:24,967 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from false [2021-11-21 00:17:26,997 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from true [2021-11-21 00:17:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:17:26,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:17:34,280 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-21 00:17:36,331 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-21 00:17:44,848 WARN L838 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) is different from false [2021-11-21 00:17:46,907 WARN L860 $PredicateComparison]: unable to prove that (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) is different from true [2021-11-21 00:17:57,247 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) is different from false [2021-11-21 00:17:59,291 WARN L860 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) is different from true [2021-11-21 00:18:13,245 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~a~0#1_9| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) is different from false [2021-11-21 00:18:15,290 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~a~0#1_9| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) is different from true [2021-11-21 00:18:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:18:15,292 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:18:15,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439752652] [2021-11-21 00:18:15,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439752652] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:18:15,292 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:18:15,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2021-11-21 00:18:15,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181857222] [2021-11-21 00:18:15,293 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:18:15,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-21 00:18:15,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:18:15,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-21 00:18:15,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=39, Unknown=14, NotChecked=126, Total=210 [2021-11-21 00:18:15,297 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:18:17,343 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~a~0#1_9| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-21 00:18:19,382 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32)))) (not (fp.geq |v_ULTIMATE.start_main_~a~0#1_9| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-21 00:18:21,430 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse2 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse3)) (.cse1 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32))))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse1))) (or .cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-21 00:18:23,478 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (let ((.cse2 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse3)) (.cse1 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32))))) (or (and .cse0 (or (not .cse1) (not .cse2))) (and .cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse1))) (or .cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 00:18:25,522 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))))) is different from false [2021-11-21 00:18:27,565 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~a~0#1|) .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))))) is different from true [2021-11-21 00:18:29,609 WARN L838 $PredicateComparison]: unable to prove that (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-21 00:18:31,665 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-21 00:18:39,579 WARN L227 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 00:18:57,337 WARN L227 SmtUtils]: Spent 6.84s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 00:18:58,606 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:19:00,785 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:19:00,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:19:00,844 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-11-21 00:19:00,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 00:19:00,844 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-11-21 00:19:00,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:19:00,847 INFO L225 Difference]: With dead ends: 20 [2021-11-21 00:19:00,847 INFO L226 Difference]: Without dead ends: 18 [2021-11-21 00:19:00,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 77.5s TimeCoverageRelationStatistics Valid=45, Invalid=61, Unknown=28, NotChecked=286, Total=420 [2021-11-21 00:19:00,849 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:19:00,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 63 Unchecked, 3.5s Time] [2021-11-21 00:19:00,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-21 00:19:00,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-21 00:19:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:19:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-11-21 00:19:00,857 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2021-11-21 00:19:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:19:00,858 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-11-21 00:19:00,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:19:00,858 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-11-21 00:19:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-21 00:19:00,860 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:19:00,860 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:19:00,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-21 00:19:01,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:19:01,063 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:19:01,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:19:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2021-11-21 00:19:01,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:19:01,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958449930] [2021-11-21 00:19:01,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:19:01,065 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:19:01,065 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:19:01,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:19:01,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 00:19:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:19:01,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:19:01,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:19:07,689 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-21 00:19:09,753 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-21 00:19:22,114 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-21 00:19:30,385 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-21 00:19:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:19:30,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:19:55,340 WARN L227 SmtUtils]: Spent 16.60s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:20:11,973 WARN L227 SmtUtils]: Spent 16.63s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:20:20,255 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-21 00:20:34,412 WARN L860 $PredicateComparison]: unable to prove that (or (= c___VERIFIER_assert_~cond (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-21 00:20:34,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:20:34,425 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:20:34,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958449930] [2021-11-21 00:20:34,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958449930] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:20:34,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [427266674] [2021-11-21 00:20:34,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:20:34,426 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:20:34,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:20:34,443 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:20:34,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2021-11-21 00:20:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:20:34,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:20:34,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:20:51,135 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-21 00:20:59,392 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-21 00:20:59,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:20:59,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:21:24,369 WARN L227 SmtUtils]: Spent 16.64s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:21:41,003 WARN L227 SmtUtils]: Spent 16.63s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:21:49,305 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) is different from true [2021-11-21 00:22:03,795 WARN L860 $PredicateComparison]: unable to prove that (or (= c___VERIFIER_assert_~cond (_ bv0 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) is different from true [2021-11-21 00:22:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:22:03,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [427266674] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:22:03,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78427390] [2021-11-21 00:22:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:22:03,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:22:03,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:22:03,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:22:03,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-21 00:22:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:22:04,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:22:04,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:22:19,389 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-21 00:22:27,688 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-21 00:22:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:22:27,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:22:52,674 WARN L227 SmtUtils]: Spent 16.65s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:23:09,366 WARN L227 SmtUtils]: Spent 16.69s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:23:17,661 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-21 00:23:32,197 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv0 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-21 00:23:32,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:23:32,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78427390] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:23:32,225 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 00:23:32,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2021-11-21 00:23:32,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516932875] [2021-11-21 00:23:32,226 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 00:23:32,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-21 00:23:32,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:23:32,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-21 00:23:32,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=25, Unknown=14, NotChecked=234, Total=306 [2021-11-21 00:23:32,229 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-21 00:23:34,385 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:23:36,393 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:23:38,617 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1))) is different from true [2021-11-21 00:23:40,774 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) (or .cse0 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) .cse0)) is different from true [2021-11-21 00:23:42,948 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-21 00:23:45,132 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from false [2021-11-21 00:23:47,289 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from true [2021-11-21 00:23:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:23:47,292 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2021-11-21 00:23:47,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 00:23:47,292 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 15 [2021-11-21 00:23:47,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:23:47,293 INFO L225 Difference]: With dead ends: 22 [2021-11-21 00:23:47,293 INFO L226 Difference]: Without dead ends: 17 [2021-11-21 00:23:47,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=41, Invalid=28, Unknown=19, NotChecked=374, Total=462 [2021-11-21 00:23:47,296 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:23:47,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 83 Unchecked, 4.2s Time] [2021-11-21 00:23:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-21 00:23:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-21 00:23:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:23:47,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-21 00:23:47,302 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-11-21 00:23:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:23:47,304 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-21 00:23:47,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-21 00:23:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-21 00:23:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-21 00:23:47,305 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:23:47,306 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:23:47,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:23:47,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2021-11-21 00:23:47,757 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-21 00:23:47,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:23:47,918 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:23:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:23:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2021-11-21 00:23:47,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:23:47,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142735827] [2021-11-21 00:23:47,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:23:47,921 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:23:47,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:23:47,922 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:23:47,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-21 00:23:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:23:51,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-21 00:23:51,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:24:31,468 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (fp.gt .cse0 .cse1) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-21 00:25:40,095 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse3)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse2 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32)))))) is different from false [2021-11-21 00:25:42,151 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse3)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse2 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32)))))) is different from true [2021-11-21 00:26:37,991 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse3)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (not .cse2) (= c___VERIFIER_assert_~cond (_ bv0 32))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32)))))) is different from false [2021-11-21 00:26:40,049 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse3)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (not .cse2) (= c___VERIFIER_assert_~cond (_ bv0 32))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32)))))) is different from true [2021-11-21 00:26:56,941 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))) (_ bv0 32))) (fp.gt .cse1 .cse2) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32)))))) is different from false [2021-11-21 00:26:59,000 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven .cse1 .cse2)))) (_ bv0 32))) (fp.gt .cse1 .cse2) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32)))))) is different from true [2021-11-21 00:26:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-11-21 00:26:59,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:27:05,698 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-21 00:27:07,764 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-21 00:27:22,479 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) is different from false [2021-11-21 00:27:24,569 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) is different from true [2021-11-21 00:27:52,138 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from false [2021-11-21 00:27:54,214 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from true [2021-11-21 00:28:09,035 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from false [2021-11-21 00:28:11,121 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from true [2021-11-21 00:28:28,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_13| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_13|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_13| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32))))))) is different from false [2021-11-21 00:28:30,226 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_13| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_13| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_13|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)) (not (fp.gt .cse1 .cse2)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_13| ((_ to_fp 11 53) c_currentRoundingMode (_ bv5 32))))))) is different from true [2021-11-21 00:28:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-21 00:28:30,227 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:28:30,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142735827] [2021-11-21 00:28:30,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142735827] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:28:30,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [934459536] [2021-11-21 00:28:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:28:30,228 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:28:30,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:28:30,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:28:30,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64ac8b2a-d356-4e90-a030-f1830c3c1b8c/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-21 00:28:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:28:37,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-21 00:28:37,120 INFO L286 TraceCheckSpWp]: Computing forward predicates...