./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:05:59,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:05:59,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:05:59,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:05:59,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:05:59,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:05:59,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:05:59,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:05:59,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:05:59,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:05:59,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:05:59,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:05:59,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:05:59,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:05:59,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:05:59,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:05:59,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:05:59,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:05:59,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:05:59,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:05:59,786 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:05:59,787 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:05:59,788 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:05:59,789 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:05:59,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:05:59,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:05:59,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:05:59,794 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:05:59,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:05:59,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:05:59,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:05:59,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:05:59,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:05:59,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:05:59,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:05:59,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:05:59,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:05:59,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:05:59,802 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:05:59,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:05:59,804 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:05:59,805 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-20 06:05:59,830 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:05:59,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:05:59,831 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:05:59,831 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:05:59,832 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:05:59,832 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:05:59,833 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:05:59,833 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:05:59,833 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:05:59,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:05:59,833 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:05:59,834 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 06:05:59,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:05:59,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:05:59,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:05:59,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:05:59,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:05:59,835 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:05:59,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:05:59,835 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:05:59,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:05:59,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:05:59,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:05:59,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:05:59,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:05:59,836 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:05:59,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:05:59,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:05:59,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-20 06:05:59,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 06:05:59,837 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:05:59,838 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:05:59,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:05:59,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:05:59,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/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_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2021-11-20 06:06:00,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:06:00,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:06:00,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:06:00,124 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:06:00,125 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:06:00,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2021-11-20 06:06:00,187 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data/5bf942df9/23df075b273f46d2b0a58cbc8eda5f91/FLAG3ac28f7e9 [2021-11-20 06:06:00,607 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:06:00,608 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/sv-benchmarks/c/float-benchs/zonotope_2.c [2021-11-20 06:06:00,614 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data/5bf942df9/23df075b273f46d2b0a58cbc8eda5f91/FLAG3ac28f7e9 [2021-11-20 06:06:01,001 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data/5bf942df9/23df075b273f46d2b0a58cbc8eda5f91 [2021-11-20 06:06:01,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:06:01,004 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:06:01,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:06:01,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:06:01,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:06:01,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,022 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e62915a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01, skipping insertion in model container [2021-11-20 06:06:01,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:06:01,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:06:01,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-11-20 06:06:01,184 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:06:01,193 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:06:01,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-11-20 06:06:01,210 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:06:01,222 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:06:01,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01 WrapperNode [2021-11-20 06:06:01,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:06:01,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:06:01,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:06:01,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:06:01,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,253 INFO L137 Inliner]: procedures = 12, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2021-11-20 06:06:01,254 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:06:01,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:06:01,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:06:01,255 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:06:01,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,271 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:06:01,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:06:01,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:06:01,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:06:01,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (1/1) ... [2021-11-20 06:06:01,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:06:01,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:01,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:01,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:06:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:06:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:06:01,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:06:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 06:06:01,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-20 06:06:01,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-20 06:06:01,486 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:06:01,488 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:06:01,625 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:06:01,632 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:06:01,632 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 06:06:01,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:01 BoogieIcfgContainer [2021-11-20 06:06:01,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:06:01,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:06:01,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:06:01,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:06:01,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:06:01" (1/3) ... [2021-11-20 06:06:01,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3011b1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:06:01, skipping insertion in model container [2021-11-20 06:06:01,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:01" (2/3) ... [2021-11-20 06:06:01,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3011b1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:06:01, skipping insertion in model container [2021-11-20 06:06:01,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:01" (3/3) ... [2021-11-20 06:06:01,644 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2021-11-20 06:06:01,653 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:06:01,654 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 06:06:01,699 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:06:01,706 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:06:01,706 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 06:06:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 06:06:01,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-20 06:06:01,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:01,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:01,728 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:06:01,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:01,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2021-11-20 06:06:01,741 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:01,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349798161] [2021-11-20 06:06:01,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:01,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:01,865 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-20 06:06:01,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:01,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349798161] [2021-11-20 06:06:01,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349798161] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:06:01,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:06:01,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 06:06:01,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041461079] [2021-11-20 06:06:01,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:06:01,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 06:06:01,875 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:01,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 06:06:01,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 06:06:01,904 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-20 06:06:01,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:01,922 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-11-20 06:06:01,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 06:06:01,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2021-11-20 06:06:01,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:06:01,931 INFO L225 Difference]: With dead ends: 32 [2021-11-20 06:06:01,931 INFO L226 Difference]: Without dead ends: 13 [2021-11-20 06:06:01,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 06:06:01,938 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:06:01,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:06:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-20 06:06:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-20 06:06:01,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:06:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-20 06:06:01,975 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-11-20 06:06:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:06:01,975 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-20 06:06:01,975 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-20 06:06:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-20 06:06:01,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-20 06:06:01,976 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:01,977 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:01,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 06:06:01,977 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:06:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:01,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2021-11-20 06:06:01,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:01,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105208322] [2021-11-20 06:06:01,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:01,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:02,033 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-20 06:06:02,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-20 06:06:02,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105208322] [2021-11-20 06:06:02,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105208322] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 06:06:02,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:06:02,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 06:06:02,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131821253] [2021-11-20 06:06:02,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:06:02,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 06:06:02,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-20 06:06:02,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 06:06:02,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:06:02,037 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-20 06:06:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:02,064 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2021-11-20 06:06:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:06:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2021-11-20 06:06:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:06:02,066 INFO L225 Difference]: With dead ends: 24 [2021-11-20 06:06:02,066 INFO L226 Difference]: Without dead ends: 17 [2021-11-20 06:06:02,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 06:06:02,069 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:06:02,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:06:02,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-11-20 06:06:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2021-11-20 06:06:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:06:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-20 06:06:02,090 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-11-20 06:06:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:06:02,091 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-20 06:06:02,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-20 06:06:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-20 06:06:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-20 06:06:02,092 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:02,092 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:02,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 06:06:02,093 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:06:02,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2021-11-20 06:06:02,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-20 06:06:02,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334089841] [2021-11-20 06:06:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:02,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 06:06:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:02,117 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 06:06:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 06:06:02,146 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-11-20 06:06:02,147 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 06:06:02,148 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-20 06:06:02,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 06:06:02,153 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-20 06:06:02,156 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 06:06:02,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:06:02 BoogieIcfgContainer [2021-11-20 06:06:02,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 06:06:02,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 06:06:02,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 06:06:02,178 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 06:06:02,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:01" (3/4) ... [2021-11-20 06:06:02,181 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-20 06:06:02,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 06:06:02,182 INFO L158 Benchmark]: Toolchain (without parser) took 1177.78ms. Allocated memory is still 102.8MB. Free memory was 65.3MB in the beginning and 45.4MB in the end (delta: 19.9MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2021-11-20 06:06:02,183 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 102.8MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:06:02,183 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.24ms. Allocated memory is still 102.8MB. Free memory was 65.1MB in the beginning and 55.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-20 06:06:02,184 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.99ms. Allocated memory is still 102.8MB. Free memory was 55.2MB in the beginning and 53.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 06:06:02,184 INFO L158 Benchmark]: Boogie Preprocessor took 18.02ms. Allocated memory is still 102.8MB. Free memory was 53.7MB in the beginning and 52.7MB in the end (delta: 988.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:06:02,185 INFO L158 Benchmark]: RCFGBuilder took 361.54ms. Allocated memory is still 102.8MB. Free memory was 52.6MB in the beginning and 72.7MB in the end (delta: -20.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-11-20 06:06:02,186 INFO L158 Benchmark]: TraceAbstraction took 540.45ms. Allocated memory is still 102.8MB. Free memory was 72.2MB in the beginning and 45.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-20 06:06:02,186 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 102.8MB. Free memory was 45.9MB in the beginning and 45.4MB in the end (delta: 503.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 06:06:02,189 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.29ms. Allocated memory is still 102.8MB. Free memory is still 81.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.24ms. Allocated memory is still 102.8MB. Free memory was 65.1MB in the beginning and 55.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.99ms. Allocated memory is still 102.8MB. Free memory was 55.2MB in the beginning and 53.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.02ms. Allocated memory is still 102.8MB. Free memory was 53.7MB in the beginning and 52.7MB in the end (delta: 988.5kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 361.54ms. Allocated memory is still 102.8MB. Free memory was 52.6MB in the beginning and 72.7MB in the end (delta: -20.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 540.45ms. Allocated memory is still 102.8MB. Free memory was 72.2MB in the beginning and 45.9MB in the end (delta: 26.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 102.8MB. Free memory was 45.9MB in the beginning and 45.4MB in the end (delta: 503.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 10]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 25, overapproximation of someBinaryArithmeticFLOAToperation at line 22. Possible FailurePath: [L14] float x = 12.f; [L15] float x1 = 12.f; [L16] float y = 16.f; [L17] float y1 = 16.f; [L18] int i; [L19] i = 0 VAL [i=0, x=12, x1=12, y=16, y1=16] [L19] COND TRUE i < 100000 [L20] x = x1 [L21] y = y1 [L22] x1 = 3.f * x / 4.f + y / 4.f [L23] y1 = x / 4.f + 3.f * y / 4.f VAL [i=0, x=12, y=16] [L25] CALL __VERIFIER_assert(x1 >= 0.f && x1 <= 100.f) VAL [\old(cond)=0] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L10] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 14 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-20 06:06:02,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/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_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-20 06:06:04,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 06:06:04,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 06:06:04,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 06:06:04,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 06:06:04,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 06:06:04,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 06:06:04,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 06:06:04,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 06:06:04,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 06:06:04,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 06:06:04,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 06:06:04,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 06:06:04,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 06:06:04,545 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 06:06:04,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 06:06:04,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 06:06:04,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 06:06:04,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 06:06:04,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 06:06:04,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 06:06:04,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 06:06:04,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 06:06:04,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 06:06:04,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 06:06:04,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 06:06:04,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 06:06:04,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 06:06:04,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 06:06:04,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 06:06:04,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 06:06:04,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 06:06:04,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 06:06:04,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 06:06:04,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 06:06:04,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 06:06:04,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 06:06:04,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 06:06:04,608 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 06:06:04,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 06:06:04,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 06:06:04,614 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-11-20 06:06:04,675 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 06:06:04,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 06:06:04,676 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 06:06:04,676 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 06:06:04,677 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 06:06:04,677 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 06:06:04,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 06:06:04,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 06:06:04,679 INFO L138 SettingsManager]: * Use SBE=true [2021-11-20 06:06:04,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 06:06:04,681 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 06:06:04,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 06:06:04,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 06:06:04,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-20 06:06:04,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 06:06:04,682 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-20 06:06:04,682 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 06:06:04,683 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-20 06:06:04,683 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-20 06:06:04,683 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 06:06:04,683 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-20 06:06:04,683 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 06:06:04,683 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-20 06:06:04,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 06:06:04,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-20 06:06:04,684 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 06:06:04,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:06:04,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 06:06:04,685 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 06:06:04,685 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-20 06:06:04,686 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-11-20 06:06:04,686 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-20 06:06:04,686 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-20 06:06:04,686 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-20 06:06:04,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-20 06:06:04,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 06:06:04,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 06:06:04,687 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_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/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_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 194855cc593aace8a0b3bff26f13c89f126df5a7be0755153ae044c8b9c94359 [2021-11-20 06:06:05,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 06:06:05,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 06:06:05,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 06:06:05,083 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 06:06:05,084 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 06:06:05,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/../../sv-benchmarks/c/float-benchs/zonotope_2.c [2021-11-20 06:06:05,143 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data/40fe26960/ea0106afe8b7436793f53c318946d789/FLAG5076ec5bf [2021-11-20 06:06:05,621 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 06:06:05,622 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/sv-benchmarks/c/float-benchs/zonotope_2.c [2021-11-20 06:06:05,628 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data/40fe26960/ea0106afe8b7436793f53c318946d789/FLAG5076ec5bf [2021-11-20 06:06:06,006 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/data/40fe26960/ea0106afe8b7436793f53c318946d789 [2021-11-20 06:06:06,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 06:06:06,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 06:06:06,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 06:06:06,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 06:06:06,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 06:06:06,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d93fed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06, skipping insertion in model container [2021-11-20 06:06:06,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 06:06:06,037 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 06:06:06,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-11-20 06:06:06,186 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:06:06,199 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 06:06:06,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/sv-benchmarks/c/float-benchs/zonotope_2.c[473,486] [2021-11-20 06:06:06,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 06:06:06,232 INFO L208 MainTranslator]: Completed translation [2021-11-20 06:06:06,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06 WrapperNode [2021-11-20 06:06:06,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 06:06:06,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 06:06:06,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 06:06:06,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 06:06:06,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,291 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2021-11-20 06:06:06,291 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 06:06:06,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 06:06:06,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 06:06:06,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 06:06:06,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,330 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 06:06:06,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 06:06:06,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 06:06:06,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 06:06:06,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (1/1) ... [2021-11-20 06:06:06,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 06:06:06,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/z3 [2021-11-20 06:06:06,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 06:06:06,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 06:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 06:06:06,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 06:06:06,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 06:06:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-20 06:06:06,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-20 06:06:06,416 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-20 06:06:06,476 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 06:06:06,477 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 06:06:08,621 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 06:06:08,626 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 06:06:08,626 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-20 06:06:08,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:08 BoogieIcfgContainer [2021-11-20 06:06:08,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 06:06:08,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 06:06:08,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 06:06:08,632 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 06:06:08,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:06:06" (1/3) ... [2021-11-20 06:06:08,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fa5333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:06:08, skipping insertion in model container [2021-11-20 06:06:08,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:06:06" (2/3) ... [2021-11-20 06:06:08,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fa5333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:06:08, skipping insertion in model container [2021-11-20 06:06:08,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:06:08" (3/3) ... [2021-11-20 06:06:08,636 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_2.c [2021-11-20 06:06:08,641 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 06:06:08,642 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-20 06:06:08,692 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 06:06:08,699 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-20 06:06:08,699 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-20 06:06:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-11-20 06:06:08,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-20 06:06:08,719 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:08,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:08,721 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:06:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:08,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1815999968, now seen corresponding path program 1 times [2021-11-20 06:06:08,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:06:08,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595693326] [2021-11-20 06:06:08,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:08,740 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:06:08,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:06:08,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:06:08,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-20 06:06:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:08,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-20 06:06:08,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:08,929 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-20 06:06:08,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:08,958 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-20 06:06:08,959 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:06:08,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595693326] [2021-11-20 06:06:08,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595693326] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:06:08,960 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:06:08,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-20 06:06:08,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139562331] [2021-11-20 06:06:08,962 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:06:08,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-20 06:06:08,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:06:09,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-20 06:06:09,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-20 06:06:09,024 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-20 06:06:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:09,043 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-11-20 06:06:09,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-20 06:06:09,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 7 [2021-11-20 06:06:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:06:09,053 INFO L225 Difference]: With dead ends: 32 [2021-11-20 06:06:09,053 INFO L226 Difference]: Without dead ends: 13 [2021-11-20 06:06:09,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-20 06:06:09,061 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-20 06:06:09,062 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-20 06:06:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-20 06:06:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-20 06:06:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:06:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-20 06:06:09,098 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-11-20 06:06:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:06:09,099 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-20 06:06:09,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-20 06:06:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-20 06:06:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-20 06:06:09,100 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:09,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:09,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:09,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:06:09,313 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:06:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1808611800, now seen corresponding path program 1 times [2021-11-20 06:06:09,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:06:09,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923789068] [2021-11-20 06:06:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:09,316 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:06:09,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:06:09,317 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:06:09,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-20 06:06:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:09,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-20 06:06:09,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:09,468 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-20 06:06:09,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:09,515 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-20 06:06:09,516 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:06:09,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923789068] [2021-11-20 06:06:09,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923789068] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:06:09,520 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:06:09,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-11-20 06:06:09,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169565253] [2021-11-20 06:06:09,521 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:06:09,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 06:06:09,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:06:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 06:06:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:06:09,525 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-20 06:06:11,693 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:06:11,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:11,734 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2021-11-20 06:06:11,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 06:06:11,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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 7 [2021-11-20 06:06:11,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:06:11,736 INFO L225 Difference]: With dead ends: 21 [2021-11-20 06:06:11,736 INFO L226 Difference]: Without dead ends: 14 [2021-11-20 06:06:11,737 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-20 06:06:11,738 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-11-20 06:06:11,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-11-20 06:06:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-20 06:06:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-20 06:06:11,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-20 06:06:11,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-20 06:06:11,745 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-11-20 06:06:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:06:11,746 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-20 06:06:11,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 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-20 06:06:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-20 06:06:11,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-20 06:06:11,747 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:11,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:11,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-20 06:06:11,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:06:11,954 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:06:11,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1810339678, now seen corresponding path program 1 times [2021-11-20 06:06:11,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:06:11,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799103904] [2021-11-20 06:06:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:11,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:06:11,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:06:11,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:06:11,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-20 06:06:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:12,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 06:06:12,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:12,440 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-20 06:06:12,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:22,767 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-11-20 06:06:24,786 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:06:24,802 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-20 06:06:24,802 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:06:24,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799103904] [2021-11-20 06:06:24,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799103904] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-20 06:06:24,803 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-20 06:06:24,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2021-11-20 06:06:24,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549355941] [2021-11-20 06:06:24,804 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-20 06:06:24,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-20 06:06:24,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:06:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-20 06:06:24,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=67, Unknown=2, NotChecked=16, Total=110 [2021-11-20 06:06:24,805 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-20 06:06:26,103 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:06:28,340 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from true [2021-11-20 06:06:30,627 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:06:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:30,791 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2021-11-20 06:06:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-20 06:06:30,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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 7 [2021-11-20 06:06:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:06:30,793 INFO L225 Difference]: With dead ends: 31 [2021-11-20 06:06:30,793 INFO L226 Difference]: Without dead ends: 29 [2021-11-20 06:06:30,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=45, Invalid=116, Unknown=3, NotChecked=46, Total=210 [2021-11-20 06:06:30,795 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 27 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:06:30,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 51 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 1 Unknown, 26 Unchecked, 3.6s Time] [2021-11-20 06:06:30,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-20 06:06:30,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2021-11-20 06:06:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:06:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2021-11-20 06:06:30,806 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 7 [2021-11-20 06:06:30,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:06:30,807 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2021-11-20 06:06:30,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-20 06:06:30,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2021-11-20 06:06:30,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-20 06:06:30,807 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:30,807 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:30,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-20 06:06:31,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:06:31,008 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:06:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:31,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1269539930, now seen corresponding path program 1 times [2021-11-20 06:06:31,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:06:31,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791854951] [2021-11-20 06:06:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:31,010 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:06:31,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:06:31,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:06:31,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-20 06:06:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:31,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-20 06:06:31,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:31,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:31,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:41,898 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-11-20 06:06:43,918 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:06:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-20 06:06:43,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:06:43,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791854951] [2021-11-20 06:06:43,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791854951] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-20 06:06:43,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-20 06:06:43,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2021-11-20 06:06:43,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786592393] [2021-11-20 06:06:43,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 06:06:43,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:06:43,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:06:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:06:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=67, Unknown=2, NotChecked=16, Total=110 [2021-11-20 06:06:43,936 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 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-20 06:06:45,971 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0) (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)))) is different from false [2021-11-20 06:06:47,991 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (and (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse0) (fp.geq .cse1 (_ +zero 8 24)) (fp.leq .cse1 .cse0) (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24)))) is different from true [2021-11-20 06:06:50,141 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:06:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:50,327 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2021-11-20 06:06:50,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 06:06:50,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-11-20 06:06:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:06:50,329 INFO L225 Difference]: With dead ends: 33 [2021-11-20 06:06:50,329 INFO L226 Difference]: Without dead ends: 29 [2021-11-20 06:06:50,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2021-11-20 06:06:50,331 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:06:50,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 1 Unknown, 19 Unchecked, 2.3s Time] [2021-11-20 06:06:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-11-20 06:06:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-11-20 06:06:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-11-20 06:06:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2021-11-20 06:06:50,340 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2021-11-20 06:06:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:06:50,340 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2021-11-20 06:06:50,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (2), 2 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-20 06:06:50,341 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2021-11-20 06:06:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-20 06:06:50,341 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:50,342 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:50,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-20 06:06:50,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:06:50,549 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:06:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1102679400, now seen corresponding path program 1 times [2021-11-20 06:06:50,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:06:50,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839780965] [2021-11-20 06:06:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:50,551 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:06:50,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:06:50,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:06:50,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-11-20 06:06:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:50,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-20 06:06:50,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:06:50,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:06:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:06:50,938 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:06:50,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839780965] [2021-11-20 06:06:50,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839780965] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:06:50,938 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:06:50,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-11-20 06:06:50,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123447315] [2021-11-20 06:06:50,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:06:50,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-20 06:06:50,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:06:50,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-20 06:06:50,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:06:50,946 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:06:53,030 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:06:55,212 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:06:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:06:55,304 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2021-11-20 06:06:55,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-20 06:06:55,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2021-11-20 06:06:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:06:55,306 INFO L225 Difference]: With dead ends: 40 [2021-11-20 06:06:55,306 INFO L226 Difference]: Without dead ends: 30 [2021-11-20 06:06:55,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-20 06:06:55,308 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-20 06:06:55,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2021-11-20 06:06:55,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-11-20 06:06:55,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-11-20 06:06:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:06:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-11-20 06:06:55,318 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2021-11-20 06:06:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:06:55,319 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-11-20 06:06:55,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:06:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-11-20 06:06:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-20 06:06:55,320 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:06:55,320 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 06:06:55,350 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-11-20 06:06:55,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:06:55,537 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:06:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:06:55,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1100951522, now seen corresponding path program 1 times [2021-11-20 06:06:55,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:06:55,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082331099] [2021-11-20 06:06:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 06:06:55,538 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:06:55,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:06:55,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:06:55,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-11-20 06:06:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 06:06:55,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:06:55,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:06:57,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-20 06:06:57,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:07:07,375 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-11-20 06:07:09,395 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:07:43,880 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-11-20 06:07:45,936 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:07:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2021-11-20 06:07:45,968 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:07:45,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082331099] [2021-11-20 06:07:45,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082331099] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:07:45,968 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:07:45,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-11-20 06:07:45,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732849983] [2021-11-20 06:07:45,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:07:45,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 06:07:45,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:07:45,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:07:45,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2021-11-20 06:07:45,970 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:07:47,991 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:07:50,134 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:07:52,256 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from false [2021-11-20 06:07:54,321 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from true [2021-11-20 06:07:56,354 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-20 06:07:58,792 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:07:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:07:58,928 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2021-11-20 06:07:58,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 06:07:58,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19 [2021-11-20 06:07:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:07:58,934 INFO L225 Difference]: With dead ends: 42 [2021-11-20 06:07:58,934 INFO L226 Difference]: Without dead ends: 40 [2021-11-20 06:07:58,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=53, Invalid=138, Unknown=7, NotChecked=108, Total=306 [2021-11-20 06:07:58,937 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2021-11-20 06:07:58,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 104 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 3 Unknown, 74 Unchecked, 6.7s Time] [2021-11-20 06:07:58,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-11-20 06:07:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2021-11-20 06:07:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:07:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2021-11-20 06:07:58,948 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 19 [2021-11-20 06:07:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:07:58,949 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2021-11-20 06:07:58,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-11-20 06:07:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2021-11-20 06:07:58,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-20 06:07:58,950 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:07:58,951 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-11-20 06:07:58,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-11-20 06:07:59,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:07:59,166 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:07:59,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:07:59,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1943528346, now seen corresponding path program 2 times [2021-11-20 06:07:59,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:07:59,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202833825] [2021-11-20 06:07:59,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:07:59,168 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:07:59,168 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:07:59,169 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:07:59,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-20 06:07:59,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:07:59,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:07:59,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 13 conjunts are in the unsatisfiable core [2021-11-20 06:07:59,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:08:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-20 06:08:00,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:08:11,321 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-11-20 06:08:13,344 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:08:47,728 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-20 06:08:49,793 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-20 06:08:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 3 not checked. [2021-11-20 06:08:49,827 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:08:49,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202833825] [2021-11-20 06:08:49,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202833825] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:08:49,828 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:08:49,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-11-20 06:08:49,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795713505] [2021-11-20 06:08:49,828 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:08:49,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-20 06:08:49,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:08:49,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-20 06:08:49,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=83, Unknown=4, NotChecked=38, Total=156 [2021-11-20 06:08:49,829 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:08:51,847 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:08:53,956 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:08:56,156 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from false [2021-11-20 06:08:58,230 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from true [2021-11-20 06:09:01,329 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-20 06:09:03,738 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:09:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:09:03,889 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2021-11-20 06:09:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-20 06:09:03,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24 [2021-11-20 06:09:03,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:09:03,895 INFO L225 Difference]: With dead ends: 40 [2021-11-20 06:09:03,895 INFO L226 Difference]: Without dead ends: 38 [2021-11-20 06:09:03,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=53, Invalid=138, Unknown=7, NotChecked=108, Total=306 [2021-11-20 06:09:03,896 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-11-20 06:09:03,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 3 Unknown, 60 Unchecked, 6.5s Time] [2021-11-20 06:09:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-11-20 06:09:03,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-11-20 06:09:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-11-20 06:09:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2021-11-20 06:09:03,906 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 24 [2021-11-20 06:09:03,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:09:03,906 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2021-11-20 06:09:03,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-11-20 06:09:03,907 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2021-11-20 06:09:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-11-20 06:09:03,908 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:09:03,908 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2021-11-20 06:09:03,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-20 06:09:04,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:09:04,109 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:09:04,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:09:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1358239522, now seen corresponding path program 3 times [2021-11-20 06:09:04,110 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:09:04,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785503939] [2021-11-20 06:09:04,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-20 06:09:04,111 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:09:04,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:09:04,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:09:04,117 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-11-20 06:09:04,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-20 06:09:04,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:09:04,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-20 06:09:04,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:09:10,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-20 06:09:10,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:09:20,941 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-11-20 06:09:22,972 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:09:58,177 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-11-20 06:10:00,253 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:10:36,595 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-20 06:10:38,706 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-20 06:10:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2021-11-20 06:10:38,733 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:10:38,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785503939] [2021-11-20 06:10:38,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785503939] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:10:38,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:10:38,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-11-20 06:10:38,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765209730] [2021-11-20 06:10:38,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:10:38,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 06:10:38,734 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:10:38,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:10:38,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=99, Unknown=8, NotChecked=66, Total=210 [2021-11-20 06:10:38,735 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-20 06:10:40,756 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:42,863 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:44,984 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:47,189 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from false [2021-11-20 06:10:49,305 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from true [2021-11-20 06:10:51,384 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.geq .cse4 (_ +zero 8 24)) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-20 06:10:54,100 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) .cse3) (fp.div c_currentRoundingMode .cse6 .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse6) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)))))) is different from true [2021-11-20 06:10:56,579 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:10:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:10:56,738 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2021-11-20 06:10:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:10:56,739 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 31 [2021-11-20 06:10:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:10:56,740 INFO L225 Difference]: With dead ends: 55 [2021-11-20 06:10:56,740 INFO L226 Difference]: Without dead ends: 53 [2021-11-20 06:10:56,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=61, Invalid=161, Unknown=12, NotChecked=186, Total=420 [2021-11-20 06:10:56,742 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2021-11-20 06:10:56,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 111 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 4 Unknown, 136 Unchecked, 8.8s Time] [2021-11-20 06:10:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2021-11-20 06:10:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2021-11-20 06:10:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-20 06:10:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2021-11-20 06:10:56,752 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 31 [2021-11-20 06:10:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:10:56,752 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2021-11-20 06:10:56,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2021-11-20 06:10:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2021-11-20 06:10:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-11-20 06:10:56,754 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:10:56,754 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2021-11-20 06:10:56,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-11-20 06:10:56,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:10:56,961 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:10:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:10:56,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1721810214, now seen corresponding path program 4 times [2021-11-20 06:10:56,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:10:56,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355621161] [2021-11-20 06:10:56,965 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-20 06:10:56,965 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:10:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:10:56,971 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:10:56,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-11-20 06:10:57,444 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-20 06:10:57,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:10:57,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 17 conjunts are in the unsatisfiable core [2021-11-20 06:10:57,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:11:04,078 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-20 06:11:04,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:11:14,662 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-11-20 06:11:16,687 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse1) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~y1~0#1|) .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:11:51,296 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-20 06:11:53,364 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-20 06:12:29,413 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-20 06:12:31,525 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-20 06:12:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2021-11-20 06:12:31,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:12:31,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355621161] [2021-11-20 06:12:31,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355621161] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:12:31,548 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:12:31,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-11-20 06:12:31,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404941829] [2021-11-20 06:12:31,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:12:31,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-20 06:12:31,548 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:12:31,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-20 06:12:31,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=99, Unknown=8, NotChecked=66, Total=210 [2021-11-20 06:12:31,549 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-20 06:12:33,617 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:12:35,589 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:12:37,685 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:12:39,922 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3)) .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3))) .cse3)))))) (and (= ((_ to_fp 8 24) c_currentRoundingMode 16.0) |c_ULTIMATE.start_main_~y1~0#1|) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~x1~0#1| ((_ to_fp 8 24) c_currentRoundingMode 12.0)))) is different from true [2021-11-20 06:12:41,999 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2)) .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~y1~0#1|) .cse2))) .cse2))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 16.0))) (and (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) (fp.leq .cse4 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse4 (_ +zero 8 24)) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-11-20 06:12:45,842 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 12.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 16.0)) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3))) (.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse5) .cse3) (fp.div c_currentRoundingMode .cse6 .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse6) .cse3)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (= |c_ULTIMATE.start_main_~x1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~y1~0#1| (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)))))) is different from true [2021-11-20 06:12:48,188 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:12:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:12:48,309 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2021-11-20 06:12:48,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-11-20 06:12:48,310 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 36 [2021-11-20 06:12:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:12:48,311 INFO L225 Difference]: With dead ends: 59 [2021-11-20 06:12:48,311 INFO L226 Difference]: Without dead ends: 55 [2021-11-20 06:12:48,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=61, Invalid=162, Unknown=11, NotChecked=186, Total=420 [2021-11-20 06:12:48,312 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2021-11-20 06:12:48,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 3 Unknown, 90 Unchecked, 8.6s Time] [2021-11-20 06:12:48,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2021-11-20 06:12:48,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2021-11-20 06:12:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 10 states have call successors, (10), 8 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2021-11-20 06:12:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2021-11-20 06:12:48,321 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 36 [2021-11-20 06:12:48,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:12:48,322 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2021-11-20 06:12:48,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 6 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-11-20 06:12:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2021-11-20 06:12:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-20 06:12:48,324 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:12:48,324 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2021-11-20 06:12:48,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-11-20 06:12:48,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:12:48,538 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:12:48,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:12:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash 461079576, now seen corresponding path program 2 times [2021-11-20 06:12:48,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:12:48,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129283187] [2021-11-20 06:12:48,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-20 06:12:48,539 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:12:48,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:12:48,540 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:12:48,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-11-20 06:12:48,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-20 06:12:48,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:12:49,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-20 06:12:49,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:12:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-20 06:12:49,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:12:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2021-11-20 06:12:49,787 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-11-20 06:12:49,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129283187] [2021-11-20 06:12:49,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129283187] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-20 06:12:49,788 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-11-20 06:12:49,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-11-20 06:12:49,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173592141] [2021-11-20 06:12:49,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-11-20 06:12:49,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-20 06:12:49,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-11-20 06:12:49,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-20 06:12:49,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-11-20 06:12:49,790 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 06:12:51,915 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:12:54,110 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:12:56,306 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:12:58,522 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-20 06:12:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 06:12:59,066 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2021-11-20 06:12:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 06:12:59,067 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 43 [2021-11-20 06:12:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 06:12:59,068 INFO L225 Difference]: With dead ends: 72 [2021-11-20 06:12:59,068 INFO L226 Difference]: Without dead ends: 62 [2021-11-20 06:12:59,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2021-11-20 06:12:59,069 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 12 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2021-11-20 06:12:59,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 59 Invalid, 4 Unknown, 0 Unchecked, 8.9s Time] [2021-11-20 06:12:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-11-20 06:12:59,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-11-20 06:12:59,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-11-20 06:12:59,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2021-11-20 06:12:59,083 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 43 [2021-11-20 06:12:59,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 06:12:59,083 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2021-11-20 06:12:59,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 7 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2021-11-20 06:12:59,084 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2021-11-20 06:12:59,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-20 06:12:59,085 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 06:12:59,086 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2021-11-20 06:12:59,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-11-20 06:12:59,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 [2021-11-20 06:12:59,302 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-20 06:12:59,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 06:12:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash 462807454, now seen corresponding path program 5 times [2021-11-20 06:12:59,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-11-20 06:12:59,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141577858] [2021-11-20 06:12:59,303 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-11-20 06:12:59,303 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-20 06:12:59,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat [2021-11-20 06:12:59,304 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-20 06:12:59,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1336c025-852f-454f-8918-2f29ce05db7a/bin/uautomizer-DQz5hQGWxF/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-11-20 06:13:00,112 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-11-20 06:13:00,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-20 06:13:00,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-20 06:13:00,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-20 06:13:13,242 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-11-20 06:13:13,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-20 06:13:25,470 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~x1~0#1|) .cse1) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse1))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:14:00,033 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from false [2021-11-20 06:14:02,115 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse2) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse2)) .cse2))))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) is different from true [2021-11-20 06:14:38,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-11-20 06:14:40,775 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse3 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~x1~0#1|) .cse3) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse3))) (.cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 |c_ULTIMATE.start_main_~y1~0#1|) .cse3)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse2) .cse3) (fp.div c_currentRoundingMode .cse4 .cse3))) .cse3) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse2 .cse3) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse4) .cse3)) .cse3)))))) (and (fp.leq .cse0 ((_ to_fp 8 24) c_currentRoundingMode 100.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-11-20 06:15:09,360 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4))) (.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse4) (fp.div c_currentRoundingMode .cse5 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse4)) .cse4)))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) is different from false [2021-11-20 06:15:11,494 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 100.0))) (or (let ((.cse0 (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~x1~0#1|) .cse4) (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~y1~0#1| .cse4))) (.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x1~0#1| .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~y1~0#1|) .cse4)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse4) (fp.div c_currentRoundingMode .cse5 .cse4))) .cse4) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse3 .cse4) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse5) .cse4)) .cse4)))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (_ +zero 8 24)))) (not (fp.geq |c_ULTIMATE.start_main_~y1~0#1| (_ +zero 8 24))) (not (fp.leq |c_ULTIMATE.start_main_~y1~0#1| .cse1)))) is different from true [2021-11-20 06:18:00,297 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ FloatingPoint 8 24))) (or (and (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.geq (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse2) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse2))) (.cse3 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse2)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) .cse2) (fp.div c_currentRoundingMode .cse3 .cse2))) .cse2) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse1 .cse2) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse3) .cse2)) .cse2)))) (_ +zero 8 24))) (forall ((|v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| (_ FloatingPoint 8 24))) (fp.leq (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 3.0)) (.cse6 ((_ to_fp 8 24) c_currentRoundingMode 4.0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39|) .cse6) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| .cse6))) (.cse7 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x1~0#1_BEFORE_CALL_39| .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44|) .cse6)))) (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse5) .cse6) (fp.div c_currentRoundingMode .cse7 .cse6))) .cse6) (fp.div c_currentRoundingMode (fp.add c_currentRoundingMode (fp.div c_currentRoundingMode .cse5 .cse6) (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 .cse7) .cse6)) .cse6)))) ((_ to_fp 8 24) c_currentRoundingMode 100.0)))) (and (fp.geq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| (_ +zero 8 24)) (fp.leq |v_ULTIMATE.start_main_~y1~0#1_BEFORE_CALL_44| ((_ to_fp 8 24) c_currentRoundingMode 100.0))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true