./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 63182f13 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF --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 bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 02:32:16,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 02:32:16,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 02:32:16,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 02:32:16,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 02:32:16,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 02:32:16,912 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 02:32:16,917 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 02:32:16,921 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 02:32:16,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 02:32:16,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 02:32:16,934 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 02:32:16,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 02:32:16,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 02:32:16,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 02:32:16,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 02:32:16,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 02:32:16,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 02:32:16,955 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 02:32:16,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 02:32:16,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 02:32:16,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 02:32:16,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 02:32:16,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 02:32:16,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 02:32:16,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 02:32:16,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 02:32:16,982 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 02:32:16,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 02:32:16,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 02:32:16,986 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 02:32:16,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 02:32:16,990 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 02:32:16,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 02:32:16,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 02:32:16,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 02:32:16,994 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 02:32:16,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 02:32:16,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 02:32:16,996 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 02:32:16,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 02:32:16,998 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-13 02:32:17,052 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 02:32:17,052 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 02:32:17,054 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 02:32:17,054 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 02:32:17,054 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-13 02:32:17,055 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-13 02:32:17,055 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-13 02:32:17,055 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-13 02:32:17,055 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-13 02:32:17,056 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-13 02:32:17,057 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-13 02:32:17,057 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-13 02:32:17,058 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-13 02:32:17,058 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-13 02:32:17,058 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-13 02:32:17,059 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-13 02:32:17,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 02:32:17,060 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 02:32:17,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 02:32:17,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 02:32:17,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 02:32:17,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 02:32:17,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 02:32:17,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 02:32:17,062 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 02:32:17,062 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 02:32:17,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 02:32:17,063 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 02:32:17,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 02:32:17,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 02:32:17,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 02:32:17,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:32:17,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 02:32:17,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 02:32:17,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 02:32:17,067 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-13 02:32:17,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 02:32:17,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 02:32:17,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 02:32:17,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-13 02:32:17,068 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_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/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_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF 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 -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a [2021-11-13 02:32:17,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 02:32:17,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 02:32:17,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 02:32:17,465 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 02:32:17,466 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 02:32:17,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2021-11-13 02:32:17,574 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data/0a0a06060/574bc77188d9490ba4b3af94aa8c634e/FLAG4dba8c0e3 [2021-11-13 02:32:18,121 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 02:32:18,122 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2021-11-13 02:32:18,136 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data/0a0a06060/574bc77188d9490ba4b3af94aa8c634e/FLAG4dba8c0e3 [2021-11-13 02:32:18,462 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data/0a0a06060/574bc77188d9490ba4b3af94aa8c634e [2021-11-13 02:32:18,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 02:32:18,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 02:32:18,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 02:32:18,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 02:32:18,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 02:32:18,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2530a8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18, skipping insertion in model container [2021-11-13 02:32:18,491 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 02:32:18,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 02:32:18,702 WARN L228 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_a5daa411-c079-4c27-a410-0307d3d98c5f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2021-11-13 02:32:18,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:32:18,729 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 02:32:18,744 WARN L228 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_a5daa411-c079-4c27-a410-0307d3d98c5f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2021-11-13 02:32:18,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:32:18,768 INFO L208 MainTranslator]: Completed translation [2021-11-13 02:32:18,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18 WrapperNode [2021-11-13 02:32:18,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 02:32:18,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 02:32:18,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 02:32:18,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 02:32:18,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 02:32:18,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 02:32:18,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 02:32:18,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 02:32:18,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,823 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 02:32:18,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 02:32:18,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 02:32:18,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 02:32:18,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (1/1) ... [2021-11-13 02:32:18,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:32:18,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 02:32:18,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 02:32:18,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 02:32:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 02:32:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 02:32:18,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 02:32:18,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 02:32:18,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-13 02:32:18,925 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-13 02:32:19,178 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 02:32:19,178 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-13 02:32:19,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:32:19 BoogieIcfgContainer [2021-11-13 02:32:19,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 02:32:19,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 02:32:19,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 02:32:19,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 02:32:19,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:32:18" (1/3) ... [2021-11-13 02:32:19,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446b2580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:32:19, skipping insertion in model container [2021-11-13 02:32:19,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:18" (2/3) ... [2021-11-13 02:32:19,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446b2580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:32:19, skipping insertion in model container [2021-11-13 02:32:19,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:32:19" (3/3) ... [2021-11-13 02:32:19,191 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2021-11-13 02:32:19,198 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 02:32:19,198 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 02:32:19,259 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 02:32:19,267 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-13 02:32:19,268 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 02:32:19,287 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-13 02:32:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-13 02:32:19,293 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:32:19,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-13 02:32:19,294 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:32:19,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:32:19,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1843522412, now seen corresponding path program 1 times [2021-11-13 02:32:19,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-13 02:32:19,313 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381050697] [2021-11-13 02:32:19,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:32:19,315 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 02:32:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 02:32:19,446 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-13 02:32:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-13 02:32:19,499 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-13 02:32:19,501 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-13 02:32:19,503 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-13 02:32:19,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 02:32:19,511 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-11-13 02:32:19,515 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 02:32:19,526 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.computeCurrectProc(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:203) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:586) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:181) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-13 02:32:19,529 INFO L158 Benchmark]: Toolchain (without parser) took 1062.23ms. Allocated memory is still 115.3MB. Free memory was 81.0MB in the beginning and 64.4MB in the end (delta: 16.6MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2021-11-13 02:32:19,530 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 87.0MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-13 02:32:19,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 115.3MB. Free memory was 80.8MB in the beginning and 91.2MB in the end (delta: -10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-13 02:32:19,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.91ms. Allocated memory is still 115.3MB. Free memory was 91.2MB in the beginning and 89.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 02:32:19,532 INFO L158 Benchmark]: Boogie Preprocessor took 27.74ms. Allocated memory is still 115.3MB. Free memory was 89.4MB in the beginning and 88.5MB in the end (delta: 901.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-13 02:32:19,533 INFO L158 Benchmark]: RCFGBuilder took 342.37ms. Allocated memory is still 115.3MB. Free memory was 88.5MB in the beginning and 78.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-13 02:32:19,534 INFO L158 Benchmark]: TraceAbstraction took 344.37ms. Allocated memory is still 115.3MB. Free memory was 77.5MB in the beginning and 64.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-13 02:32:19,538 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.39ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 87.0MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.39ms. Allocated memory is still 115.3MB. Free memory was 80.8MB in the beginning and 91.2MB in the end (delta: -10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.91ms. Allocated memory is still 115.3MB. Free memory was 91.2MB in the beginning and 89.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.74ms. Allocated memory is still 115.3MB. Free memory was 89.4MB in the beginning and 88.5MB in the end (delta: 901.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 342.37ms. Allocated memory is still 115.3MB. Free memory was 88.5MB in the beginning and 78.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 344.37ms. Allocated memory is still 115.3MB. Free memory was 77.5MB in the beginning and 64.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. 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 - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.computeCurrectProc(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-11-13 02:32:19,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/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_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF --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 bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a --- Real Ultimate output --- This is Ultimate 0.2.1-dev-63182f1 [2021-11-13 02:32:22,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 02:32:22,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 02:32:22,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 02:32:22,573 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 02:32:22,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 02:32:22,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 02:32:22,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 02:32:22,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 02:32:22,600 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 02:32:22,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 02:32:22,605 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 02:32:22,605 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 02:32:22,608 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 02:32:22,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 02:32:22,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 02:32:22,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 02:32:22,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 02:32:22,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 02:32:22,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 02:32:22,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 02:32:22,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 02:32:22,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 02:32:22,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 02:32:22,656 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 02:32:22,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 02:32:22,657 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 02:32:22,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 02:32:22,660 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 02:32:22,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 02:32:22,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 02:32:22,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 02:32:22,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 02:32:22,667 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 02:32:22,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 02:32:22,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 02:32:22,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 02:32:22,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 02:32:22,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 02:32:22,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 02:32:22,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 02:32:22,699 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-13 02:32:22,728 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 02:32:22,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 02:32:22,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 02:32:22,729 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 02:32:22,730 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-13 02:32:22,730 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-13 02:32:22,730 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-13 02:32:22,730 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-13 02:32:22,731 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-13 02:32:22,731 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-13 02:32:22,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 02:32:22,732 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 02:32:22,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 02:32:22,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 02:32:22,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 02:32:22,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 02:32:22,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 02:32:22,733 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-13 02:32:22,734 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-13 02:32:22,734 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-13 02:32:22,734 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 02:32:22,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 02:32:22,734 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 02:32:22,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 02:32:22,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 02:32:22,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 02:32:22,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 02:32:22,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:32:22,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 02:32:22,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 02:32:22,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 02:32:22,737 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-13 02:32:22,737 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-13 02:32:22,737 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 02:32:22,737 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-13 02:32:22,738 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-13 02:32:22,738 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_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/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_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF 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 -> bff053df41c1fc922299a13f2dac2a98df2d05e146d51bf11ac9e37ddfefad6a [2021-11-13 02:32:23,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 02:32:23,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 02:32:23,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 02:32:23,191 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 02:32:23,194 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 02:32:23,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2021-11-13 02:32:23,276 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data/342ebfcb3/eb529a0edd8547bf9375f350191ad92e/FLAG0a45ae62a [2021-11-13 02:32:23,839 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 02:32:23,839 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c [2021-11-13 02:32:23,847 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data/342ebfcb3/eb529a0edd8547bf9375f350191ad92e/FLAG0a45ae62a [2021-11-13 02:32:24,197 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/data/342ebfcb3/eb529a0edd8547bf9375f350191ad92e [2021-11-13 02:32:24,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 02:32:24,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-13 02:32:24,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 02:32:24,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 02:32:24,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 02:32:24,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6233f718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24, skipping insertion in model container [2021-11-13 02:32:24,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 02:32:24,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 02:32:24,428 WARN L228 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_a5daa411-c079-4c27-a410-0307d3d98c5f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2021-11-13 02:32:24,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:32:24,463 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 02:32:24,479 WARN L228 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_a5daa411-c079-4c27-a410-0307d3d98c5f/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound20.c[712,725] [2021-11-13 02:32:24,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 02:32:24,518 INFO L208 MainTranslator]: Completed translation [2021-11-13 02:32:24,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24 WrapperNode [2021-11-13 02:32:24,518 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 02:32:24,522 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 02:32:24,522 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 02:32:24,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 02:32:24,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 02:32:24,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 02:32:24,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 02:32:24,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 02:32:24,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 02:32:24,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 02:32:24,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 02:32:24,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 02:32:24,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (1/1) ... [2021-11-13 02:32:24,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 02:32:24,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 02:32:24,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-13 02:32:24,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-13 02:32:24,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-13 02:32:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 02:32:24,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 02:32:24,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 02:32:24,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-13 02:32:24,766 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-13 02:32:25,772 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 02:32:25,772 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-13 02:32:25,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:32:25 BoogieIcfgContainer [2021-11-13 02:32:25,775 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 02:32:25,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 02:32:25,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 02:32:25,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 02:32:25,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:32:24" (1/3) ... [2021-11-13 02:32:25,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a4599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:32:25, skipping insertion in model container [2021-11-13 02:32:25,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:32:24" (2/3) ... [2021-11-13 02:32:25,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a4599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:32:25, skipping insertion in model container [2021-11-13 02:32:25,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:32:25" (3/3) ... [2021-11-13 02:32:25,785 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound20.c [2021-11-13 02:32:25,791 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 02:32:25,791 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-13 02:32:25,849 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-13 02:32:25,858 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-13 02:32:25,858 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 02:32:25,877 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-13 02:32:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-13 02:32:25,883 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:32:25,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:32:25,885 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:32:25,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:32:25,891 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-11-13 02:32:25,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:32:25,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309081786] [2021-11-13 02:32:25,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:32:25,908 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:32:25,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:32:25,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:32:25,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-13 02:32:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:32:26,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-13 02:32:26,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:32:26,483 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-13 02:32:26,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:32:26,540 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-13 02:32:26,541 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 02:32:26,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309081786] [2021-11-13 02:32:26,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309081786] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 02:32:26,544 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-13 02:32:26,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-13 02:32:26,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496971252] [2021-11-13 02:32:26,548 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 02:32:26,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-13 02:32:26,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 02:32:26,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-13 02:32:26,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-13 02:32:26,614 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-13 02:32:26,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 02:32:26,677 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-11-13 02:32:26,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 02:32:26,679 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-13 02:32:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 02:32:26,696 INFO L225 Difference]: With dead ends: 33 [2021-11-13 02:32:26,696 INFO L226 Difference]: Without dead ends: 14 [2021-11-13 02:32:26,700 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-13 02:32:26,716 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.00ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.28ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.00ms IncrementalHoareTripleChecker+Time [2021-11-13 02:32:26,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.28ms Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.00ms Time] [2021-11-13 02:32:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-13 02:32:26,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-13 02:32:26,756 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-13 02:32:26,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-11-13 02:32:26,759 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-11-13 02:32:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 02:32:26,759 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-11-13 02:32:26,760 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-13 02:32:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-11-13 02:32:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-11-13 02:32:26,761 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:32:26,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:32:26,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-13 02:32:26,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-13 02:32:26,974 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:32:26,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:32:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-11-13 02:32:26,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:32:26,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239191690] [2021-11-13 02:32:26,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:32:26,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:32:26,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:32:26,979 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:32:26,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-13 02:32:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:32:28,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-13 02:32:28,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:33:22,690 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.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (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-13 02:34:01,877 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.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from false [2021-11-13 02:34:03,914 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.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from true [2021-11-13 02:34:20,256 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.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from false [2021-11-13 02:34:22,293 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.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) is different from true [2021-11-13 02:34:22,294 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-13 02:34:22,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:34:29,944 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-13 02:34:32,002 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-13 02:34:42,282 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-13 02:34:44,332 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-13 02:34:54,164 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-13 02:34:56,216 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-13 02:35:10,111 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 (_ bv20 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-13 02:35:12,162 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 (_ bv20 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-13 02:35:12,163 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-13 02:35:12,164 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 02:35:12,164 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239191690] [2021-11-13 02:35:12,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239191690] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-13 02:35:12,165 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-13 02:35:12,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2021-11-13 02:35:12,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806570134] [2021-11-13 02:35:12,165 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-13 02:35:12,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-13 02:35:12,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 02:35:12,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-13 02:35:12,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=40, Unknown=13, NotChecked=126, Total=210 [2021-11-13 02:35:12,169 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-13 02:35:14,238 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 (_ bv20 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-13 02:35:16,290 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 (_ bv20 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-13 02:35:18,345 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (or .cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~a~0#1|) .cse1) (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))))))) (let ((.cse3 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse1)) (.cse2 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))))) (or (and .cse0 (or (not .cse2) (not .cse3))) (and .cse3 .cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-11-13 02:35:20,396 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (or .cse0 (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~a~0#1|) .cse1) (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))))))) (let ((.cse3 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse1)) (.cse2 (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32))))) (or (and .cse0 (or (not .cse2) (not .cse3))) (and .cse3 .cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-11-13 02:35:22,846 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 (_ bv20 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-13 02:35:24,907 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 (_ bv20 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-13 02:35:26,975 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 (_ bv20 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-13 02:35:40,670 WARN L227 SmtUtils]: Spent 6.59s 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-13 02:35:42,722 WARN L838 $PredicateComparison]: unable to prove that (and (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.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32)))))) (not (= c___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-11-13 02:35:44,404 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 02:35:46,652 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 02:35:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 02:35:46,723 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-11-13 02:35:46,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-13 02:35:46,724 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-13 02:35:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 02:35:46,727 INFO L225 Difference]: With dead ends: 20 [2021-11-13 02:35:46,727 INFO L226 Difference]: Without dead ends: 18 [2021-11-13 02:35:46,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 63.7s TimeCoverageRelationStatistics Valid=44, Invalid=52, Unknown=24, NotChecked=300, Total=420 [2021-11-13 02:35:46,731 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3902.94ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.41ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 4006.42ms IncrementalHoareTripleChecker+Time [2021-11-13 02:35:46,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 71 Unknown, 0 Unchecked, 2.41ms Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 63 Unchecked, 4006.42ms Time] [2021-11-13 02:35:46,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-11-13 02:35:46,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-11-13 02:35:46,740 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-13 02:35:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-11-13 02:35:46,741 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2021-11-13 02:35:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 02:35:46,742 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-11-13 02:35:46,742 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-13 02:35:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2021-11-13 02:35:46,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-13 02:35:46,744 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:35:46,745 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:35:46,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-11-13 02:35:46,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 [2021-11-13 02:35:46,954 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:35:46,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:35:46,956 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2021-11-13 02:35:46,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:35:46,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [762141940] [2021-11-13 02:35:46,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:35:46,958 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:35:46,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:35:46,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:35:46,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-13 02:35:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:35:47,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 02:35:47,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:35:53,742 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-13 02:35:55,808 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-13 02:36:08,228 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-13 02:36:16,524 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-13 02:36:16,537 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-13 02:36:16,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:36:41,651 WARN L227 SmtUtils]: Spent 16.72s 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-13 02:36:58,381 WARN L227 SmtUtils]: Spent 16.73s 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-13 02:37:06,700 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-13 02:37:21,208 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-13 02:37:21,222 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-13 02:37:21,222 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 02:37:21,222 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [762141940] [2021-11-13 02:37:21,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [762141940] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 02:37:21,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1155470175] [2021-11-13 02:37:21,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:37:21,223 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-13 02:37:21,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/cvc4 [2021-11-13 02:37:21,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-13 02:37:21,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2021-11-13 02:37:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:37:21,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 02:37:21,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:37:38,030 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-13 02:37:46,355 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-13 02:37:46,367 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-13 02:37:46,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:38:11,432 WARN L227 SmtUtils]: Spent 16.72s 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-13 02:38:28,165 WARN L227 SmtUtils]: Spent 16.73s 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-13 02:38:36,503 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-13 02:38:51,032 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-13 02:38:51,046 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-13 02:38:51,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1155470175] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 02:38:51,047 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095146010] [2021-11-13 02:38:51,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:38:51,047 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 02:38:51,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 [2021-11-13 02:38:51,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 02:38:51,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-13 02:38:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:38:51,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-13 02:38:51,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:39:07,995 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-13 02:39:16,298 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-13 02:39:16,312 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-13 02:39:16,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:39:41,423 WARN L227 SmtUtils]: Spent 16.75s 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-13 02:39:58,092 WARN L227 SmtUtils]: Spent 16.67s 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-13 02:40:06,404 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-13 02:40:20,887 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-13 02:40:20,897 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-13 02:40:20,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095146010] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 02:40:20,898 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-13 02:40:20,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2021-11-13 02:40:20,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527839008] [2021-11-13 02:40:20,899 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-13 02:40:20,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-13 02:40:20,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-13 02:40:20,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-13 02:40:20,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=25, Unknown=14, NotChecked=234, Total=306 [2021-11-13 02:40:20,902 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-13 02:40:23,055 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-13 02:40:25,060 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-13 02:40:27,299 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-13 02:40:29,469 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-13 02:40:31,645 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-13 02:40:33,826 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-13 02:40:35,984 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-13 02:40:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-13 02:40:35,986 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2021-11-13 02:40:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-13 02:40:35,986 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-13 02:40:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-13 02:40:35,987 INFO L225 Difference]: With dead ends: 22 [2021-11-13 02:40:35,988 INFO L226 Difference]: Without dead ends: 17 [2021-11-13 02:40:35,989 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=41, Invalid=28, Unknown=19, NotChecked=374, Total=462 [2021-11-13 02:40:35,990 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4158.35ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.51ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 4229.22ms IncrementalHoareTripleChecker+Time [2021-11-13 02:40:35,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 87 Unknown, 0 Unchecked, 1.51ms Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 83 Unchecked, 4229.22ms Time] [2021-11-13 02:40:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-13 02:40:35,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-11-13 02:40:35,996 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-13 02:40:35,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-11-13 02:40:35,997 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-11-13 02:40:35,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-13 02:40:35,999 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-11-13 02:40:35,999 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-13 02:40:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-11-13 02:40:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-13 02:40:36,001 INFO L506 BasicCegarLoop]: Found error trace [2021-11-13 02:40:36,001 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-13 02:40:36,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2021-11-13 02:40:36,223 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-13 02:40:36,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-13 02:40:36,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 02:40:36,609 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 02:40:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 02:40:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2021-11-13 02:40:36,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-13 02:40:36,611 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175426087] [2021-11-13 02:40:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:40:36,611 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-13 02:40:36,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat [2021-11-13 02:40:36,612 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-13 02:40:36,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-13 02:40:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:40:40,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 02:40:40,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 02:40:57,140 WARN L227 SmtUtils]: Spent 7.66s 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-13 02:41:53,633 WARN L227 SmtUtils]: Spent 14.14s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 02:43:02,580 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.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (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|))))))) is different from false [2021-11-13 02:43:04,644 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.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (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|))))))) is different from true [2021-11-13 02:44:02,031 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.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (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)))))))) is different from false [2021-11-13 02:44:04,098 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.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (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)))))))) is different from true [2021-11-13 02:44:19,967 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.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse1 .cse2)))) is different from false [2021-11-13 02:44:22,032 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.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv20 32))) (fp.gt .cse1 .cse2)))) is different from true [2021-11-13 02:44:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2021-11-13 02:44:22,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 02:44:32,837 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-13 02:44:34,911 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-13 02:44:49,738 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-13 02:44:51,840 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-13 02:45:19,556 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-13 02:45:21,642 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-13 02:45:36,549 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-13 02:45:38,637 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-13 02:45:54,361 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 (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_13| ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (= ((_ 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))))) is different from false [2021-11-13 02:45:56,451 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 (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_13| ((_ to_fp 11 53) c_currentRoundingMode (_ bv20 32)))) (= ((_ 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))))) is different from true [2021-11-13 02:45:56,452 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-13 02:45:56,452 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-13 02:45:56,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175426087] [2021-11-13 02:45:56,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175426087] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 02:45:56,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [67438015] [2021-11-13 02:45:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 02:45:56,453 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-13 02:45:56,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/cvc4 [2021-11-13 02:45:56,457 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-13 02:45:56,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5daa411-c079-4c27-a410-0307d3d98c5f/bin/utaipan-vmNK8stdcF/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2021-11-13 02:46:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 02:46:02,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-13 02:46:02,002 INFO L286 TraceCheckSpWp]: Computing forward predicates...