./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a .................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a ........................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 08:09:11,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 08:09:11,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 08:09:11,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 08:09:11,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 08:09:11,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 08:09:11,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 08:09:11,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 08:09:11,334 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 08:09:11,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 08:09:11,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 08:09:11,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 08:09:11,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 08:09:11,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 08:09:11,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 08:09:11,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 08:09:11,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 08:09:11,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 08:09:11,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 08:09:11,383 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 08:09:11,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 08:09:11,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 08:09:11,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 08:09:11,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 08:09:11,404 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 08:09:11,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 08:09:11,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 08:09:11,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 08:09:11,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 08:09:11,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 08:09:11,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 08:09:11,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 08:09:11,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 08:09:11,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 08:09:11,427 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 08:09:11,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 08:09:11,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 08:09:11,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 08:09:11,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 08:09:11,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 08:09:11,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 08:09:11,433 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 08:09:11,491 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 08:09:11,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 08:09:11,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 08:09:11,494 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 08:09:11,494 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 08:09:11,494 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 08:09:11,495 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 08:09:11,495 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 08:09:11,495 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 08:09:11,496 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 08:09:11,497 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 08:09:11,497 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 08:09:11,498 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 08:09:11,498 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 08:09:11,498 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 08:09:11,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 08:09:11,500 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 08:09:11,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 08:09:11,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 08:09:11,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 08:09:11,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 08:09:11,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 08:09:11,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 08:09:11,502 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 08:09:11,502 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 08:09:11,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 08:09:11,502 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 08:09:11,503 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 08:09:11,503 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 08:09:11,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 08:09:11,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:09:11,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 08:09:11,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 08:09:11,505 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 08:09:11,505 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 08:09:11,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 08:09:11,506 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 08:09:11,506 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 08:09:11,506 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 08:09:11,506 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/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_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2021-10-13 08:09:11,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 08:09:11,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 08:09:11,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 08:09:11,866 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 08:09:11,875 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 08:09:11,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-13 08:09:11,961 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data/dff38d8ab/52eb42dba900408884e3b8224a8cc1cb/FLAGeb67c1721 [2021-10-13 08:09:12,565 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 08:09:12,565 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-13 08:09:12,573 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data/dff38d8ab/52eb42dba900408884e3b8224a8cc1cb/FLAGeb67c1721 [2021-10-13 08:09:12,925 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data/dff38d8ab/52eb42dba900408884e3b8224a8cc1cb [2021-10-13 08:09:12,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 08:09:12,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 08:09:12,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 08:09:12,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 08:09:12,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 08:09:12,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:09:12" (1/1) ... [2021-10-13 08:09:12,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1528fe8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:12, skipping insertion in model container [2021-10-13 08:09:12,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:09:12" (1/1) ... [2021-10-13 08:09:12,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 08:09:12,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 08:09:13,148 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-13 08:09:13,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:09:13,175 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 08:09:13,192 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-13 08:09:13,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:09:13,233 INFO L208 MainTranslator]: Completed translation [2021-10-13 08:09:13,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13 WrapperNode [2021-10-13 08:09:13,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 08:09:13,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 08:09:13,239 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 08:09:13,239 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 08:09:13,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,261 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 08:09:13,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 08:09:13,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 08:09:13,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 08:09:13,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,347 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 08:09:13,350 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 08:09:13,350 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 08:09:13,350 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 08:09:13,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (1/1) ... [2021-10-13 08:09:13,368 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:09:13,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:09:13,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 08:09:13,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 08:09:13,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 08:09:13,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 08:09:13,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 08:09:13,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 08:09:13,874 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 08:09:13,874 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-13 08:09:13,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:13 BoogieIcfgContainer [2021-10-13 08:09:13,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 08:09:13,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 08:09:13,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 08:09:13,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 08:09:13,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:09:12" (1/3) ... [2021-10-13 08:09:13,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baac3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:09:13, skipping insertion in model container [2021-10-13 08:09:13,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:13" (2/3) ... [2021-10-13 08:09:13,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7baac3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:09:13, skipping insertion in model container [2021-10-13 08:09:13,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:13" (3/3) ... [2021-10-13 08:09:13,890 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-10-13 08:09:13,911 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 08:09:13,911 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 08:09:13,993 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 08:09:14,002 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 08:09:14,003 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 08:09:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 08:09:14,026 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:14,027 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 08:09:14,028 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 08:09:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:14,035 INFO L82 PathProgramCache]: Analyzing trace with hash 65926, now seen corresponding path program 1 times [2021-10-13 08:09:14,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:09:14,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811859030] [2021-10-13 08:09:14,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:14,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:09:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 08:09:14,174 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 08:09:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 08:09:14,233 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 08:09:14,235 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 08:09:14,237 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 08:09:14,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 08:09:14,248 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 08:09:14,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:09:14 BoogieIcfgContainer [2021-10-13 08:09:14,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 08:09:14,268 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 08:09:14,268 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 08:09:14,268 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 08:09:14,269 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:13" (3/4) ... [2021-10-13 08:09:14,278 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-13 08:09:14,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 08:09:14,286 INFO L168 Benchmark]: Toolchain (without parser) took 1343.22 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 52.8 MB in the beginning and 61.2 MB in the end (delta: -8.4 MB). Peak memory consumption was 11.6 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:14,288 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 90.2 MB. Free memory is still 69.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:09:14,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.13 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 52.6 MB in the beginning and 88.0 MB in the end (delta: -35.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:14,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.98 ms. Allocated memory is still 109.1 MB. Free memory was 88.0 MB in the beginning and 86.5 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:09:14,293 INFO L168 Benchmark]: Boogie Preprocessor took 62.18 ms. Allocated memory is still 109.1 MB. Free memory was 86.5 MB in the beginning and 87.2 MB in the end (delta: -645.4 kB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:14,295 INFO L168 Benchmark]: RCFGBuilder took 527.61 ms. Allocated memory is still 109.1 MB. Free memory was 87.2 MB in the beginning and 75.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:14,296 INFO L168 Benchmark]: TraceAbstraction took 387.20 ms. Allocated memory is still 109.1 MB. Free memory was 75.0 MB in the beginning and 61.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:14,297 INFO L168 Benchmark]: Witness Printer took 11.08 ms. Allocated memory is still 109.1 MB. Free memory was 61.6 MB in the beginning and 61.2 MB in the end (delta: 397.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:09:14,302 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.70 ms. Allocated memory is still 90.2 MB. Free memory is still 69.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 292.13 ms. Allocated memory was 90.2 MB in the beginning and 109.1 MB in the end (delta: 18.9 MB). Free memory was 52.6 MB in the beginning and 88.0 MB in the end (delta: -35.4 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.98 ms. Allocated memory is still 109.1 MB. Free memory was 88.0 MB in the beginning and 86.5 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 62.18 ms. Allocated memory is still 109.1 MB. Free memory was 86.5 MB in the beginning and 87.2 MB in the end (delta: -645.4 kB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 527.61 ms. Allocated memory is still 109.1 MB. Free memory was 87.2 MB in the beginning and 75.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 387.20 ms. Allocated memory is still 109.1 MB. Free memory was 75.0 MB in the beginning and 61.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Witness Printer took 11.08 ms. Allocated memory is still 109.1 MB. Free memory was 61.6 MB in the beginning and 61.2 MB in the end (delta: 397.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L14] COND FALSE !(!cond) [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) [L16] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L16] reach_error() VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 255.5ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 10.6ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 12.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 7.2ms SsaConstructionTime, 57.4ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-13 08:09:14,350 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 08:09:17,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 08:09:17,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 08:09:17,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 08:09:17,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 08:09:17,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 08:09:17,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 08:09:17,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 08:09:17,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 08:09:17,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 08:09:17,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 08:09:17,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 08:09:17,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 08:09:17,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 08:09:17,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 08:09:17,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 08:09:17,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 08:09:17,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 08:09:17,579 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 08:09:17,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 08:09:17,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 08:09:17,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 08:09:17,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 08:09:17,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 08:09:17,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 08:09:17,617 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 08:09:17,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 08:09:17,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 08:09:17,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 08:09:17,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 08:09:17,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 08:09:17,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 08:09:17,628 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 08:09:17,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 08:09:17,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 08:09:17,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 08:09:17,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 08:09:17,633 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 08:09:17,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 08:09:17,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 08:09:17,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 08:09:17,639 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-13 08:09:17,696 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 08:09:17,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 08:09:17,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 08:09:17,698 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 08:09:17,699 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 08:09:17,699 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 08:09:17,699 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 08:09:17,700 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 08:09:17,701 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 08:09:17,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 08:09:17,704 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 08:09:17,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 08:09:17,705 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 08:09:17,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 08:09:17,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 08:09:17,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 08:09:17,706 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 08:09:17,706 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 08:09:17,706 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 08:09:17,707 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 08:09:17,707 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 08:09:17,707 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 08:09:17,707 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 08:09:17,708 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 08:09:17,708 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 08:09:17,708 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 08:09:17,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:09:17,709 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 08:09:17,709 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 08:09:17,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 08:09:17,710 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 08:09:17,710 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 08:09:17,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 08:09:17,711 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 08:09:17,711 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 08:09:17,712 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_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/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_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0c4d229f60f1a19f1b80be7acb6ce64e15b5c4a [2021-10-13 08:09:18,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 08:09:18,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 08:09:18,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 08:09:18,214 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 08:09:18,215 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 08:09:18,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-13 08:09:18,297 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data/7f5c71fbc/91ce19eec5024805bad1de72b69aad8a/FLAGaf8ce3f19 [2021-10-13 08:09:18,976 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 08:09:18,977 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-13 08:09:18,987 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data/7f5c71fbc/91ce19eec5024805bad1de72b69aad8a/FLAGaf8ce3f19 [2021-10-13 08:09:19,314 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/data/7f5c71fbc/91ce19eec5024805bad1de72b69aad8a [2021-10-13 08:09:19,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 08:09:19,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 08:09:19,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 08:09:19,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 08:09:19,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 08:09:19,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbdd9c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19, skipping insertion in model container [2021-10-13 08:09:19,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 08:09:19,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 08:09:19,597 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-13 08:09:19,622 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:09:19,647 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 08:09:19,668 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-13 08:09:19,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:09:19,714 INFO L208 MainTranslator]: Completed translation [2021-10-13 08:09:19,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19 WrapperNode [2021-10-13 08:09:19,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 08:09:19,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 08:09:19,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 08:09:19,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 08:09:19,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 08:09:19,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 08:09:19,795 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 08:09:19,795 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 08:09:19,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,829 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,871 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 08:09:19,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 08:09:19,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 08:09:19,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 08:09:19,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (1/1) ... [2021-10-13 08:09:19,889 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:09:19,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:09:19,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 08:09:19,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 08:09:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 08:09:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 08:09:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 08:09:19,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 08:09:24,568 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 08:09:24,568 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-13 08:09:24,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:24 BoogieIcfgContainer [2021-10-13 08:09:24,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 08:09:24,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 08:09:24,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 08:09:24,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 08:09:24,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:09:19" (1/3) ... [2021-10-13 08:09:24,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa65a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:09:24, skipping insertion in model container [2021-10-13 08:09:24,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:19" (2/3) ... [2021-10-13 08:09:24,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa65a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:09:24, skipping insertion in model container [2021-10-13 08:09:24,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:24" (3/3) ... [2021-10-13 08:09:24,582 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-10-13 08:09:24,589 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 08:09:24,589 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-13 08:09:24,647 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 08:09:24,656 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 08:09:24,656 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-13 08:09:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 08:09:24,679 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:24,679 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:09:24,680 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 08:09:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-10-13 08:09:24,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:24,703 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628049997] [2021-10-13 08:09:24,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:24,704 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:24,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:24,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:24,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 08:09:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:25,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2021-10-13 08:09:25,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:25,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:25,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:25,937 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:09:25,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628049997] [2021-10-13 08:09:25,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628049997] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:09:25,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:09:25,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 08:09:25,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801844713] [2021-10-13 08:09:25,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-13 08:09:25,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:09:25,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-13 08:09:25,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 08:09:25,967 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:25,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:09:25,984 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-10-13 08:09:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-13 08:09:25,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 08:09:25,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:09:25,995 INFO L225 Difference]: With dead ends: 21 [2021-10-13 08:09:25,995 INFO L226 Difference]: Without dead ends: 8 [2021-10-13 08:09:25,999 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-13 08:09:26,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-13 08:09:26,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-13 08:09:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-10-13 08:09:26,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-10-13 08:09:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:09:26,036 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-10-13 08:09:26,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-10-13 08:09:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 08:09:26,038 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:26,038 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:09:26,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:26,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:09:26,253 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 08:09:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-10-13 08:09:26,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:26,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907687246] [2021-10-13 08:09:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:26,256 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:26,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:26,258 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:26,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 08:09:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:28,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-13 08:09:28,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:45,150 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))) c_ULTIMATE.start_main_~S~0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-13 08:11:32,525 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) is different from false [2021-10-13 08:11:34,603 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) is different from true [2021-10-13 08:12:26,900 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.geq .cse0 .cse1)) (not (fp.leq .cse0 .cse2))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2021-10-13 08:12:28,977 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.geq .cse0 .cse1)) (not (fp.leq .cse0 .cse2))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2021-10-13 08:12:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:12:28,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:12:44,973 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-10-13 08:12:47,126 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-10-13 08:13:07,415 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-10-13 08:13:09,579 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-10-13 08:14:04,683 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) is different from false [2021-10-13 08:14:06,841 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) is different from true [2021-10-13 08:14:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:14:06,842 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:14:06,842 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907687246] [2021-10-13 08:14:06,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907687246] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:14:06,843 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:14:06,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-10-13 08:14:06,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50646157] [2021-10-13 08:14:06,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 08:14:06,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:14:06,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 08:14:06,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-10-13 08:14:06,848 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:14:08,974 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-13 08:14:11,132 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-10-13 08:14:13,261 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from false [2021-10-13 08:14:15,420 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from true [2021-10-13 08:14:17,548 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from false [2021-10-13 08:14:19,710 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from true [2021-10-13 08:14:21,846 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))) c_ULTIMATE.start_main_~S~0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-13 08:14:23,992 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-10-13 08:14:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:14:24,046 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2021-10-13 08:14:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 08:14:24,047 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 08:14:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:14:24,048 INFO L225 Difference]: With dead ends: 12 [2021-10-13 08:14:24,048 INFO L226 Difference]: Without dead ends: 8 [2021-10-13 08:14:24,049 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41111.5ms TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-10-13 08:14:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-13 08:14:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-13 08:14:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:14:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2021-10-13 08:14:24,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2021-10-13 08:14:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:14:24,052 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2021-10-13 08:14:24,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:14:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2021-10-13 08:14:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 08:14:24,053 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:14:24,053 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:14:24,075 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 08:14:24,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:14:24,254 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 08:14:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:14:24,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2021-10-13 08:14:24,260 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:14:24,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671945239] [2021-10-13 08:14:24,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:14:24,261 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:14:24,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:14:24,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:14:24,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 08:14:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:14:37,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 08:14:37,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:14:54,258 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0)))))))))) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-13 08:16:43,309 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) is different from false [2021-10-13 08:16:45,408 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) is different from true [2021-10-13 08:17:38,357 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2021-10-13 08:17:40,436 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2021-10-13 08:17:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:17:40,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:17:56,276 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-10-13 08:17:58,414 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-10-13 08:18:18,361 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from false [2021-10-13 08:18:20,507 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from true [2021-10-13 08:19:14,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) is different from false [2021-10-13 08:19:16,672 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) is different from true [2021-10-13 08:19:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:19:16,673 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:19:16,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671945239] [2021-10-13 08:19:16,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671945239] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:19:16,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:19:16,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-10-13 08:19:16,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574370820] [2021-10-13 08:19:16,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-13 08:19:16,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:19:16,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-13 08:19:16,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-10-13 08:19:16,678 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:19:18,818 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-13 08:19:20,982 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-10-13 08:19:23,126 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from false [2021-10-13 08:19:25,261 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from true [2021-10-13 08:19:27,388 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-10-13 08:19:29,537 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-10-13 08:19:31,688 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0)))))))))) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-13 08:19:33,838 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4))))) is different from false [2021-10-13 08:19:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:19:33,849 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2021-10-13 08:19:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 08:19:33,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-13 08:19:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:19:33,850 INFO L225 Difference]: With dead ends: 8 [2021-10-13 08:19:33,850 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 08:19:33,851 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41167.2ms TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-10-13 08:19:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 08:19:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 08:19:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:19:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 08:19:33,851 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2021-10-13 08:19:33,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:19:33,852 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 08:19:33,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:19:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 08:19:33,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 08:19:33,855 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 08:19:33,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 08:19:34,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:19:34,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 08:19:34,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 08:19:34,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 08:19:34,112 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 08:19:34,112 INFO L860 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2021-10-13 08:19:34,114 INFO L857 garLoopResultBuilder]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2021-10-13 08:19:34,114 INFO L857 garLoopResultBuilder]: For program point L13(lines 27 28) no Hoare annotation was computed. [2021-10-13 08:19:34,115 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 08:19:34,115 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 08:19:34,115 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 08:19:34,116 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-10-13 08:19:34,117 INFO L857 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-10-13 08:19:34,117 INFO L857 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-10-13 08:19:34,118 INFO L857 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-10-13 08:19:34,118 INFO L860 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2021-10-13 08:19:34,124 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 08:19:34,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:19:34 BoogieIcfgContainer [2021-10-13 08:19:34,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 08:19:34,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 08:19:34,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 08:19:34,132 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 08:19:34,133 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:24" (3/4) ... [2021-10-13 08:19:34,137 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 08:19:34,148 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-13 08:19:34,149 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-13 08:19:34,149 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 08:19:34,149 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 08:19:34,188 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 08:19:34,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 08:19:34,190 INFO L168 Benchmark]: Toolchain (without parser) took 614869.85 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 44.7 MB in the beginning and 43.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2021-10-13 08:19:34,191 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 65.0 MB. Free memory is still 44.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:19:34,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.64 ms. Allocated memory is still 65.0 MB. Free memory was 44.5 MB in the beginning and 34.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-13 08:19:34,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.53 ms. Allocated memory is still 65.0 MB. Free memory was 34.1 MB in the beginning and 48.0 MB in the end (delta: -13.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 16.1 GB. [2021-10-13 08:19:34,193 INFO L168 Benchmark]: Boogie Preprocessor took 81.35 ms. Allocated memory is still 65.0 MB. Free memory was 48.0 MB in the beginning and 46.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 08:19:34,194 INFO L168 Benchmark]: RCFGBuilder took 4693.71 ms. Allocated memory is still 65.0 MB. Free memory was 46.7 MB in the beginning and 37.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 08:19:34,194 INFO L168 Benchmark]: TraceAbstraction took 609557.80 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 36.8 MB in the beginning and 45.8 MB in the end (delta: -9.0 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. [2021-10-13 08:19:34,195 INFO L168 Benchmark]: Witness Printer took 56.95 ms. Allocated memory is still 79.7 MB. Free memory was 45.8 MB in the beginning and 43.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 08:19:34,198 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.35 ms. Allocated memory is still 65.0 MB. Free memory is still 44.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 394.64 ms. Allocated memory is still 65.0 MB. Free memory was 44.5 MB in the beginning and 34.2 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 74.53 ms. Allocated memory is still 65.0 MB. Free memory was 34.1 MB in the beginning and 48.0 MB in the end (delta: -13.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 81.35 ms. Allocated memory is still 65.0 MB. Free memory was 48.0 MB in the beginning and 46.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 4693.71 ms. Allocated memory is still 65.0 MB. Free memory was 46.7 MB in the beginning and 37.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 609557.80 ms. Allocated memory was 65.0 MB in the beginning and 79.7 MB in the end (delta: 14.7 MB). Free memory was 36.8 MB in the beginning and 45.8 MB in the end (delta: -9.0 MB). Peak memory consumption was 8.8 MB. Max. memory is 16.1 GB. * Witness Printer took 56.95 ms. Allocated memory is still 79.7 MB. Free memory was 45.8 MB in the beginning and 43.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 609478.1ms, OverallIterations: 3, TraceHistogramMax: 1, EmptinessCheckTime: 11.8ms, AutomataDifference: 34428.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 54.9ms, InitialAbstractionConstructionTime: 11.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 11 SDs, 0 SdLazy, 11 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 122.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82278.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 21.6ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 40.0ms HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 4.6ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 38.3ms SsaConstructionTime, 16077.9ms SatisfiabilityAnalysisTime, 557958.0ms InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 8 QuantifiedInterpolants, 1563 SizeOfPredicates, 15 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-10-13 08:19:34,424 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-10-13 08:19:34,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a4f208e-8dea-481f-85e1-1c6addde1463/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...