./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan --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-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan --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.0-a4ecdab [2020-11-30 01:38:35,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:38:35,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:38:35,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:38:35,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:38:35,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:38:35,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:38:35,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:38:35,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:38:35,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:38:35,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:38:35,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:38:35,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:38:35,204 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:38:35,206 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:38:35,208 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:38:35,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:38:35,211 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:38:35,215 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:38:35,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:38:35,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:38:35,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:38:35,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:38:35,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:38:35,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:38:35,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:38:35,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:38:35,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:38:35,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:38:35,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:38:35,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:38:35,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:38:35,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:38:35,242 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:38:35,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:38:35,244 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:38:35,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:38:35,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:38:35,245 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:38:35,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:38:35,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:38:35,249 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-30 01:38:35,304 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:38:35,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:38:35,314 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:38:35,315 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 01:38:35,315 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 01:38:35,315 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 01:38:35,316 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-30 01:38:35,316 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 01:38:35,316 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 01:38:35,317 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-30 01:38:35,318 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-30 01:38:35,318 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 01:38:35,319 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-30 01:38:35,319 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-30 01:38:35,319 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-30 01:38:35,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:38:35,321 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:38:35,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 01:38:35,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:38:35,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:38:35,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:38:35,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:38:35,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:38:35,323 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:38:35,323 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:38:35,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:38:35,324 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:38:35,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:38:35,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:38:35,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:38:35,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:38:35,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:38:35,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:38:35,329 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:38:35,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:38:35,329 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-30 01:38:35,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 01:38:35,330 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:38:35,330 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:38:35,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:38:35,331 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-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/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-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan 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 [2020-11-30 01:38:35,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:38:35,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:38:35,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:38:35,678 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:38:35,680 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:38:35,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-11-30 01:38:35,781 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data/fbe95d3fd/1c66d08505d24a71a1b71c01f2707c58/FLAGc6665d976 [2020-11-30 01:38:36,334 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:38:36,334 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-11-30 01:38:36,341 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data/fbe95d3fd/1c66d08505d24a71a1b71c01f2707c58/FLAGc6665d976 [2020-11-30 01:38:36,707 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data/fbe95d3fd/1c66d08505d24a71a1b71c01f2707c58 [2020-11-30 01:38:36,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:38:36,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:38:36,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:38:36,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:38:36,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:38:36,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:38:36" (1/1) ... [2020-11-30 01:38:36,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eb86a3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:36, skipping insertion in model container [2020-11-30 01:38:36,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:38:36" (1/1) ... [2020-11-30 01:38:36,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:38:36,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:38:37,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:38:37,017 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:38:37,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:38:37,055 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:38:37,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37 WrapperNode [2020-11-30 01:38:37,055 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:38:37,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:38:37,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:38:37,057 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:38:37,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... [2020-11-30 01:38:37,076 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... [2020-11-30 01:38:37,096 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:38:37,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:38:37,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:38:37,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:38:37,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... [2020-11-30 01:38:37,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... [2020-11-30 01:38:37,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... [2020-11-30 01:38:37,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... [2020-11-30 01:38:37,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... [2020-11-30 01:38:37,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... [2020-11-30 01:38:37,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... [2020-11-30 01:38:37,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:38:37,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:38:37,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:38:37,146 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:38:37,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:38:37,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 01:38:37,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:38:37,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:38:37,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:38:37,712 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:38:37,713 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-11-30 01:38:37,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:38:37 BoogieIcfgContainer [2020-11-30 01:38:37,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:38:37,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:38:37,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:38:37,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:38:37,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:38:36" (1/3) ... [2020-11-30 01:38:37,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e6e46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:38:37, skipping insertion in model container [2020-11-30 01:38:37,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:37" (2/3) ... [2020-11-30 01:38:37,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42e6e46c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:38:37, skipping insertion in model container [2020-11-30 01:38:37,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:38:37" (3/3) ... [2020-11-30 01:38:37,727 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2020-11-30 01:38:37,761 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:38:37,774 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:38:37,790 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:38:37,827 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:38:37,828 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:38:37,828 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:38:37,828 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:38:37,829 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:38:37,829 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:38:37,829 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:38:37,829 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:38:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2020-11-30 01:38:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-30 01:38:37,852 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:38:37,853 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-30 01:38:37,853 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:38:37,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:38:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash 68809, now seen corresponding path program 1 times [2020-11-30 01:38:37,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-30 01:38:37,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146672595] [2020-11-30 01:38:37,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 01:38:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:38:38,026 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:38:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 01:38:38,108 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 01:38:38,167 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-30 01:38:38,168 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 01:38:38,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 01:38:38,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:38:38 BoogieIcfgContainer [2020-11-30 01:38:38,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:38:38,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:38:38,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:38:38,204 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:38:38,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:38:37" (3/4) ... [2020-11-30 01:38:38,209 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-30 01:38:38,209 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:38:38,214 INFO L168 Benchmark]: Toolchain (without parser) took 1497.39 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 51.1 MB in the beginning and 81.7 MB in the end (delta: -30.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:38:38,217 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 83.9 MB. Free memory was 41.7 MB in the beginning and 41.7 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:38:38,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.41 ms. Allocated memory is still 83.9 MB. Free memory was 50.8 MB in the beginning and 60.4 MB in the end (delta: -9.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-30 01:38:38,220 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.62 ms. Allocated memory is still 83.9 MB. Free memory was 60.4 MB in the beginning and 59.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:38:38,222 INFO L168 Benchmark]: Boogie Preprocessor took 47.78 ms. Allocated memory is still 83.9 MB. Free memory was 59.0 MB in the beginning and 57.9 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:38:38,223 INFO L168 Benchmark]: RCFGBuilder took 569.46 ms. Allocated memory is still 83.9 MB. Free memory was 57.9 MB in the beginning and 40.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-30 01:38:38,225 INFO L168 Benchmark]: TraceAbstraction took 483.28 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 40.5 MB in the beginning and 82.0 MB in the end (delta: -41.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:38:38,226 INFO L168 Benchmark]: Witness Printer took 5.71 ms. Allocated memory is still 104.9 MB. Free memory was 82.0 MB in the beginning and 81.7 MB in the end (delta: 355.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:38:38,237 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.38 ms. Allocated memory is still 83.9 MB. Free memory was 41.7 MB in the beginning and 41.7 MB in the end (delta: 75.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 331.41 ms. Allocated memory is still 83.9 MB. Free memory was 50.8 MB in the beginning and 60.4 MB in the end (delta: -9.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 39.62 ms. Allocated memory is still 83.9 MB. Free memory was 60.4 MB in the beginning and 59.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.78 ms. Allocated memory is still 83.9 MB. Free memory was 59.0 MB in the beginning and 57.9 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 569.46 ms. Allocated memory is still 83.9 MB. Free memory was 57.9 MB in the beginning and 40.8 MB in the end (delta: 17.1 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 483.28 ms. Allocated memory was 83.9 MB in the beginning and 104.9 MB in the end (delta: 21.0 MB). Free memory was 40.5 MB in the beginning and 82.0 MB in the end (delta: -41.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 5.71 ms. Allocated memory is still 104.9 MB. Free memory was 82.0 MB in the beginning and 81.7 MB in the end (delta: 355.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() 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 FALSE !(I >= 2.) [L28] S = 1.+(I-1.) * (.5+(I-1.) * (-.125+(I-1.)*.0625)) [L16] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L3] __assert_fail("0", "sqrt_poly.c", 3, "reach_error") VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-30 01:38:41,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 01:38:41,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 01:38:41,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 01:38:41,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 01:38:41,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 01:38:41,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 01:38:41,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 01:38:41,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 01:38:41,450 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 01:38:41,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 01:38:41,454 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 01:38:41,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 01:38:41,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 01:38:41,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 01:38:41,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 01:38:41,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 01:38:41,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 01:38:41,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 01:38:41,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 01:38:41,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 01:38:41,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 01:38:41,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 01:38:41,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 01:38:41,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 01:38:41,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 01:38:41,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 01:38:41,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 01:38:41,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 01:38:41,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 01:38:41,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 01:38:41,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 01:38:41,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 01:38:41,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 01:38:41,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 01:38:41,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 01:38:41,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 01:38:41,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 01:38:41,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 01:38:41,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 01:38:41,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 01:38:41,527 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-11-30 01:38:41,562 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 01:38:41,563 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 01:38:41,564 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-30 01:38:41,564 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-30 01:38:41,565 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-30 01:38:41,565 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-30 01:38:41,565 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-30 01:38:41,566 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-30 01:38:41,566 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-30 01:38:41,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 01:38:41,567 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 01:38:41,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 01:38:41,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 01:38:41,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 01:38:41,569 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 01:38:41,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 01:38:41,569 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-30 01:38:41,570 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-30 01:38:41,570 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-30 01:38:41,570 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 01:38:41,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 01:38:41,571 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 01:38:41,571 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 01:38:41,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 01:38:41,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 01:38:41,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 01:38:41,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 01:38:41,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:38:41,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 01:38:41,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 01:38:41,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 01:38:41,575 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-11-30 01:38:41,575 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-30 01:38:41,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 01:38:41,576 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 01:38:41,576 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-30 01:38:41,576 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-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/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-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan 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 [2020-11-30 01:38:42,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 01:38:42,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 01:38:42,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 01:38:42,172 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 01:38:42,173 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 01:38:42,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-11-30 01:38:42,254 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data/e894564ed/d7206ebe1af243ad957ec64e9a26b7a2/FLAGfa75948c6 [2020-11-30 01:38:42,870 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 01:38:42,871 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/sv-benchmarks/c/float-benchs/sqrt_poly.c [2020-11-30 01:38:42,879 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data/e894564ed/d7206ebe1af243ad957ec64e9a26b7a2/FLAGfa75948c6 [2020-11-30 01:38:43,210 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/data/e894564ed/d7206ebe1af243ad957ec64e9a26b7a2 [2020-11-30 01:38:43,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 01:38:43,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 01:38:43,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 01:38:43,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 01:38:43,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 01:38:43,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,234 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d8767 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43, skipping insertion in model container [2020-11-30 01:38:43,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,244 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 01:38:43,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 01:38:43,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:38:43,583 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 01:38:43,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 01:38:43,664 INFO L208 MainTranslator]: Completed translation [2020-11-30 01:38:43,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43 WrapperNode [2020-11-30 01:38:43,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 01:38:43,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 01:38:43,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 01:38:43,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 01:38:43,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 01:38:43,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 01:38:43,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 01:38:43,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 01:38:43,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... [2020-11-30 01:38:43,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 01:38:43,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 01:38:43,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 01:38:43,774 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 01:38:43,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 01:38:43,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-30 01:38:43,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 01:38:43,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 01:38:43,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 01:38:48,603 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 01:38:48,603 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-11-30 01:38:48,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:38:48 BoogieIcfgContainer [2020-11-30 01:38:48,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 01:38:48,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 01:38:48,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 01:38:48,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 01:38:48,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 01:38:43" (1/3) ... [2020-11-30 01:38:48,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472a6359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:38:48, skipping insertion in model container [2020-11-30 01:38:48,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 01:38:43" (2/3) ... [2020-11-30 01:38:48,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@472a6359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 01:38:48, skipping insertion in model container [2020-11-30 01:38:48,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:38:48" (3/3) ... [2020-11-30 01:38:48,617 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2020-11-30 01:38:48,631 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 01:38:48,637 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-30 01:38:48,652 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-30 01:38:48,719 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 01:38:48,725 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 01:38:48,725 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 01:38:48,726 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 01:38:48,726 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 01:38:48,726 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 01:38:48,726 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 01:38:48,727 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 01:38:48,749 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2020-11-30 01:38:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:38:48,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:38:48,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:38:48,769 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:38:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:38:48,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2020-11-30 01:38:48,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:38:48,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738918316] [2020-11-30 01:38:48,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-30 01:38:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:38:49,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2020-11-30 01:38:49,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:38:49,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:38:49,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:38:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:38:49,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738918316] [2020-11-30 01:38:49,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:38:49,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-30 01:38:49,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093841188] [2020-11-30 01:38:49,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-30 01:38:49,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:38:49,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-30 01:38:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:38:49,913 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-11-30 01:38:49,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:38:49,931 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2020-11-30 01:38:49,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-30 01:38:49,933 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-11-30 01:38:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:38:49,942 INFO L225 Difference]: With dead ends: 22 [2020-11-30 01:38:49,942 INFO L226 Difference]: Without dead ends: 8 [2020-11-30 01:38:49,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-30 01:38:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-30 01:38:49,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-30 01:38:49,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 01:38:49,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2020-11-30 01:38:49,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2020-11-30 01:38:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:38:49,983 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2020-11-30 01:38:49,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-30 01:38:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2020-11-30 01:38:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:38:49,983 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:38:49,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:38:50,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-30 01:38:50,198 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:38:50,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:38:50,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2020-11-30 01:38:50,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:38:50,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740979936] [2020-11-30 01:38:50,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-30 01:38:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:38:52,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-30 01:38:52,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:38:52,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:38:55,134 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.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.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))))) is different from false [2020-11-30 01:38:55,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:38:57,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:39:12,422 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse1) .cse0))) (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)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.geq .cse2 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse2 .cse1)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (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 .cse6) .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)))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse4) (fp.geq ULTIMATE.start_main_~I~0 .cse6) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7) (and .cse7 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse10) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))) .cse10)) (fp.geq ULTIMATE.start_main_~I~0 .cse10) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))))) is different from false [2020-11-30 01:39:23,203 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse3) (fp.geq v_prenex_1 .cse4) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse4) .cse3))) (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)))))) .cse4)))))) is different from false [2020-11-30 01:39:25,332 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq v_prenex_1 .cse3) (fp.geq v_prenex_1 .cse4) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse4) .cse3))) (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)))))) .cse4)))))) is different from true [2020-11-30 01:39:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:39:25,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:39:27,672 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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 .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2020-11-30 01:39:29,893 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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 .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2020-11-30 01:39:32,147 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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 .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-11-30 01:39:34,359 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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 .cse0 .cse1) (fp.leq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-11-30 01:39:34,391 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 01:39:34,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:39:34,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:39:36,517 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (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 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (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)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (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 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .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)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from false [2020-11-30 01:39:38,953 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (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 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (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)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (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 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .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)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from true [2020-11-30 01:39:38,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:39:38,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1740979936] [2020-11-30 01:39:38,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:39:38,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-11-30 01:39:38,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831970313] [2020-11-30 01:39:38,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 01:39:38,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:39:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:39:38,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=10, NotChecked=90, Total=156 [2020-11-30 01:39:38,968 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 13 states. [2020-11-30 01:39:41,125 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (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 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (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)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (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 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .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)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from false [2020-11-30 01:39:43,523 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (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 .cse0)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse1 (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)) .cse1)))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2))))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (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 .cse3)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse5) .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)))))) .cse5) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)))))) is different from true [2020-11-30 01:39:45,645 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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 .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) .cse4)) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse4))))) is different from false [2020-11-30 01:39:47,861 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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 .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)) .cse4)) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse4))))) is different from true [2020-11-30 01:39:50,014 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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 .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2020-11-30 01:39:52,249 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse1))) (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 .cse0 .cse1) (fp.leq .cse0 .cse2))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse2)))) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2020-11-30 01:39:54,388 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.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.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))))) is different from false [2020-11-30 01:39:56,553 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.geq .cse3 .cse1) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.leq .cse3 .cse2)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7) .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse6)))))) .cse5)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (fp.geq ULTIMATE.start_main_~I~0 .cse7) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0) (and .cse0 (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse10) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))) .cse10)) (fp.geq ULTIMATE.start_main_~I~0 .cse10) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))))) is different from false [2020-11-30 01:39:56,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:39:56,590 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2020-11-30 01:39:56,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:39:56,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2020-11-30 01:39:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:39:56,592 INFO L225 Difference]: With dead ends: 12 [2020-11-30 01:39:56,592 INFO L226 Difference]: Without dead ends: 8 [2020-11-30 01:39:56,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=35, Invalid=33, Unknown=18, NotChecked=220, Total=306 [2020-11-30 01:39:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-11-30 01:39:56,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-11-30 01:39:56,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-11-30 01:39:56,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2020-11-30 01:39:56,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2020-11-30 01:39:56,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:39:56,598 INFO L481 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2020-11-30 01:39:56,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 01:39:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2020-11-30 01:39:56,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-30 01:39:56,598 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 01:39:56,599 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-30 01:39:56,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 01:39:56,799 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 01:39:56,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 01:39:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2020-11-30 01:39:56,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-11-30 01:39:56,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911012387] [2020-11-30 01:39:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 01:40:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 01:40:05,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 01:40:05,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 01:40:05,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 01:40:07,936 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 (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= 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))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-11-30 01:40:10,064 WARN L860 $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 (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= 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))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-11-30 01:40:10,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:40:14,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-30 01:40:27,722 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 (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))))))))))) (and (fp.leq .cse0 .cse1) (not (fp.geq ULTIMATE.start_main_~I~0 .cse1)) (fp.geq .cse0 .cse2) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse5) (not (fp.leq (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse6 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.geq (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse8)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse7))) is different from false [2020-11-30 01:40:38,747 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)))))) is different from false [2020-11-30 01:40:40,857 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)))))) is different from true [2020-11-30 01:40:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:40:40,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 01:40:43,106 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.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from false [2020-11-30 01:40:45,263 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.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from true [2020-11-30 01:40:47,417 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) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (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.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from false [2020-11-30 01:40:49,572 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) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (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.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from true [2020-11-30 01:40:49,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 01:40:49,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 01:40:49,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-30 01:40:51,713 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .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))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from false [2020-11-30 01:40:54,005 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .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))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from true [2020-11-30 01:40:54,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 01:40:54,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911012387] [2020-11-30 01:40:54,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 01:40:54,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2020-11-30 01:40:54,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123375757] [2020-11-30 01:40:54,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-30 01:40:54,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-11-30 01:40:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-30 01:40:54,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2020-11-30 01:40:54,010 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand 13 states. [2020-11-30 01:40:56,144 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .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))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from false [2020-11-30 01:40:58,441 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.leq (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .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))))))))) .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)))))) is different from true [2020-11-30 01:41:00,597 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse3))))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse1))))) is different from false [2020-11-30 01:41:02,765 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) .cse1 (let ((.cse2 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse4 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.leq .cse2 .cse0) (fp.geq .cse2 .cse3))))) (let ((.cse5 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3)) (.cse6 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6) (and (or (not .cse5) (not .cse6)) .cse1))))) is different from true [2020-11-30 01:41:04,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (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.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from false [2020-11-30 01:41:07,123 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (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.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)))) is different from true [2020-11-30 01:41:09,290 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 (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (= 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))))))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) is different from false [2020-11-30 01:41:11,461 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.leq .cse1 .cse2) (not (fp.geq ULTIMATE.start_main_~I~0 .cse2)) (fp.geq .cse1 .cse3) (fp.geq ULTIMATE.start_main_~I~0 .cse3) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse5)) (fp.geq ULTIMATE.start_main_~I~0 .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse6 (let ((.cse7 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse6))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse5)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~I~0 .cse8) (not (fp.geq (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse8)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))))) .cse0)))) is different from false [2020-11-30 01:41:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 01:41:11,469 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2020-11-30 01:41:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 01:41:11,469 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2020-11-30 01:41:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 01:41:11,470 INFO L225 Difference]: With dead ends: 8 [2020-11-30 01:41:11,470 INFO L226 Difference]: Without dead ends: 0 [2020-11-30 01:41:11,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.8s TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2020-11-30 01:41:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-30 01:41:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-30 01:41:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-30 01:41:11,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-30 01:41:11,471 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2020-11-30 01:41:11,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 01:41:11,472 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-30 01:41:11,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-30 01:41:11,472 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-30 01:41:11,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-30 01:41:11,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 01:41:11,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-30 01:41:11,717 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-30 01:41:11,717 INFO L277 CegarLoopResult]: At program point L31(lines 20 32) the Hoare annotation is: true [2020-11-30 01:41:11,717 INFO L274 CegarLoopResult]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2020-11-30 01:41:11,717 INFO L274 CegarLoopResult]: For program point L13(lines 27 28) no Hoare annotation was computed. [2020-11-30 01:41:11,717 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-30 01:41:11,717 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-30 01:41:11,718 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-30 01:41:11,718 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-30 01:41:11,718 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-30 01:41:11,718 INFO L274 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-11-30 01:41:11,718 INFO L274 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-11-30 01:41:11,718 INFO L274 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-11-30 01:41:11,718 INFO L277 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: true [2020-11-30 01:41:11,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 01:41:11 BoogieIcfgContainer [2020-11-30 01:41:11,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 01:41:11,729 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 01:41:11,729 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 01:41:11,729 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 01:41:11,730 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 01:38:48" (3/4) ... [2020-11-30 01:41:11,736 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-30 01:41:11,749 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-11-30 01:41:11,750 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-11-30 01:41:11,750 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 01:41:11,751 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-30 01:41:11,810 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0c52b870-d7fb-4f96-afcb-bf2f1a5b22d4/bin/utaipan/witness.graphml [2020-11-30 01:41:11,815 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 01:41:11,818 INFO L168 Benchmark]: Toolchain (without parser) took 148599.66 ms. Allocated memory was 48.2 MB in the beginning and 92.3 MB in the end (delta: 44.0 MB). Free memory was 25.0 MB in the beginning and 46.8 MB in the end (delta: -21.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:11,818 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 48.2 MB. Free memory is still 31.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:41:11,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 446.89 ms. Allocated memory was 48.2 MB in the beginning and 75.5 MB in the end (delta: 27.3 MB). Free memory was 24.7 MB in the beginning and 59.3 MB in the end (delta: -34.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:11,822 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.22 ms. Allocated memory is still 75.5 MB. Free memory was 59.3 MB in the beginning and 57.8 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:41:11,825 INFO L168 Benchmark]: Boogie Preprocessor took 35.01 ms. Allocated memory is still 75.5 MB. Free memory was 57.8 MB in the beginning and 56.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 01:41:11,829 INFO L168 Benchmark]: RCFGBuilder took 4832.10 ms. Allocated memory is still 75.5 MB. Free memory was 56.3 MB in the beginning and 44.9 MB in the end (delta: 11.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:11,832 INFO L168 Benchmark]: TraceAbstraction took 143120.38 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 44.5 MB in the beginning and 48.9 MB in the end (delta: -4.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:11,835 INFO L168 Benchmark]: Witness Printer took 86.39 ms. Allocated memory is still 92.3 MB. Free memory was 48.9 MB in the beginning and 46.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 01:41:11,838 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 48.2 MB. Free memory is still 31.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 446.89 ms. Allocated memory was 48.2 MB in the beginning and 75.5 MB in the end (delta: 27.3 MB). Free memory was 24.7 MB in the beginning and 59.3 MB in the end (delta: -34.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.22 ms. Allocated memory is still 75.5 MB. Free memory was 59.3 MB in the beginning and 57.8 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.01 ms. Allocated memory is still 75.5 MB. Free memory was 57.8 MB in the beginning and 56.6 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4832.10 ms. Allocated memory is still 75.5 MB. Free memory was 56.3 MB in the beginning and 44.9 MB in the end (delta: 11.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 143120.38 ms. Allocated memory was 75.5 MB in the beginning and 92.3 MB in the end (delta: 16.8 MB). Free memory was 44.5 MB in the beginning and 48.9 MB in the end (delta: -4.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 16.1 GB. * Witness Printer took 86.39 ms. Allocated memory is still 92.3 MB. Free memory was 48.9 MB in the beginning and 46.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 142.9s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 35.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 16 SDs, 0 SdLazy, 12 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 12.0s SatisfiabilityAnalysisTime, 94.8s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 8 QuantifiedInterpolants, 10554 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 RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...