./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 f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a4836c40967b3aafd0bbb2ea7228f657b02305b .............................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8a4836c40967b3aafd0bbb2ea7228f657b02305b ........................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:27:25,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:27:25,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:27:25,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:27:25,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:27:25,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:27:25,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:27:25,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:27:25,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:27:25,230 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:27:25,231 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:27:25,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:27:25,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:27:25,232 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:27:25,233 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:27:25,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:27:25,234 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:27:25,235 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:27:25,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:27:25,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:27:25,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:27:25,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:27:25,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:27:25,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:27:25,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:27:25,242 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:27:25,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:27:25,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:27:25,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:27:25,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:27:25,244 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:27:25,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:27:25,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:27:25,245 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:27:25,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:27:25,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:27:25,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:27:25,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:27:25,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:27:25,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:27:25,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:27:25,248 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:27:25,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:27:25,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:27:25,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:27:25,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:27:25,259 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:27:25,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:27:25,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:27:25,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:27:25,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:27:25,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:27:25,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:27:25,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:27:25,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:27:25,260 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:27:25,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:27:25,260 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:27:25,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:27:25,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:27:25,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:27:25,261 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:27:25,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:27:25,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:27:25,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:27:25,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:27:25,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:27:25,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:27:25,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:27:25,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:27:25,262 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:27:25,262 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a4836c40967b3aafd0bbb2ea7228f657b02305b [2019-12-07 17:27:25,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:27:25,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:27:25,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:27:25,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:27:25,376 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:27:25,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2019-12-07 17:27:25,416 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data/56540f695/4ec959e377254066ad58ec943c472df6/FLAG1ac476c42 [2019-12-07 17:27:25,809 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:27:25,809 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/sv-benchmarks/c/float-benchs/sqrt_poly.c [2019-12-07 17:27:25,813 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data/56540f695/4ec959e377254066ad58ec943c472df6/FLAG1ac476c42 [2019-12-07 17:27:25,824 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data/56540f695/4ec959e377254066ad58ec943c472df6 [2019-12-07 17:27:25,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:27:25,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:27:25,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:27:25,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:27:25,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:27:25,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:27:25" (1/1) ... [2019-12-07 17:27:25,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0e63b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:25, skipping insertion in model container [2019-12-07 17:27:25,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:27:25" (1/1) ... [2019-12-07 17:27:25,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:27:25,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:27:25,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:27:25,998 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:27:26,013 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:27:26,024 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:27:26,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26 WrapperNode [2019-12-07 17:27:26,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:27:26,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:27:26,025 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:27:26,025 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:27:26,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... [2019-12-07 17:27:26,039 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... [2019-12-07 17:27:26,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:27:26,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:27:26,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:27:26,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:27:26,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... [2019-12-07 17:27:26,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... [2019-12-07 17:27:26,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... [2019-12-07 17:27:26,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... [2019-12-07 17:27:26,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... [2019-12-07 17:27:26,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... [2019-12-07 17:27:26,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... [2019-12-07 17:27:26,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:27:26,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:27:26,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:27:26,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:27:26,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/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 [2019-12-07 17:27:26,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:27:26,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:27:26,213 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:27:26,214 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 17:27:26,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:27:26 BoogieIcfgContainer [2019-12-07 17:27:26,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:27:26,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:27:26,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:27:26,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:27:26,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:27:25" (1/3) ... [2019-12-07 17:27:26,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39521c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:27:26, skipping insertion in model container [2019-12-07 17:27:26,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:26" (2/3) ... [2019-12-07 17:27:26,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39521c5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:27:26, skipping insertion in model container [2019-12-07 17:27:26,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:27:26" (3/3) ... [2019-12-07 17:27:26,220 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2019-12-07 17:27:26,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:27:26,230 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:27:26,239 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:27:26,254 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:27:26,254 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:27:26,255 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:27:26,255 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:27:26,255 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:27:26,255 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:27:26,255 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:27:26,255 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:27:26,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-12-07 17:27:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 17:27:26,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:26,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 17:27:26,270 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:26,275 INFO L82 PathProgramCache]: Analyzing trace with hash 889508713, now seen corresponding path program 1 times [2019-12-07 17:27:26,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:26,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595510428] [2019-12-07 17:27:26,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:27:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:27:26,361 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:27:26,361 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:27:26,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:27:26 BoogieIcfgContainer [2019-12-07 17:27:26,375 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:27:26,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:27:26,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:27:26,376 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:27:26,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:27:26" (3/4) ... [2019-12-07 17:27:26,379 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:27:26,379 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:27:26,381 INFO L168 Benchmark]: Toolchain (without parser) took 552.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -134.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:27:26,381 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:27:26,382 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:27:26,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:27:26,383 INFO L168 Benchmark]: Boogie Preprocessor took 12.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:27:26,383 INFO L168 Benchmark]: RCFGBuilder took 149.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:27:26,384 INFO L168 Benchmark]: TraceAbstraction took 160.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:27:26,384 INFO L168 Benchmark]: Witness Printer took 3.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:27:26,387 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 197.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.10 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 149.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 160.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.06 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 11]: 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 22. Possible FailurePath: [L13] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L17] double S, I; [L19] I = __VERIFIER_nondet_double() [L22] COND TRUE I >= 2. [L22] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L11] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L11] __VERIFIER_error() VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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.1.25-f470102 [2019-12-07 17:27:27,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:27:27,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:27:27,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:27:27,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:27:27,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:27:27,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:27:27,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:27:27,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:27:27,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:27:27,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:27:27,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:27:27,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:27:27,802 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:27:27,803 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:27:27,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:27:27,804 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:27:27,805 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:27:27,807 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:27:27,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:27:27,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:27:27,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:27:27,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:27:27,811 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:27:27,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:27:27,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:27:27,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:27:27,814 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:27:27,814 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:27:27,815 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:27:27,815 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:27:27,816 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:27:27,816 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:27:27,817 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:27:27,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:27:27,818 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:27:27,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:27:27,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:27:27,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:27:27,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:27:27,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:27:27,820 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 17:27:27,830 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:27:27,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:27:27,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:27:27,831 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:27:27,831 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:27:27,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:27:27,832 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:27:27,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:27:27,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:27:27,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:27:27,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:27:27,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:27:27,832 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:27:27,833 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:27:27,833 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:27:27,833 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:27:27,833 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:27:27,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:27:27,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:27:27,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:27:27,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:27:27,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:27:27,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:27:27,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:27:27,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:27:27,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:27:27,834 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:27:27,834 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:27:27,834 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:27:27,835 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:27:27,835 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:27:27,835 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8a4836c40967b3aafd0bbb2ea7228f657b02305b [2019-12-07 17:27:27,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:27:28,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:27:28,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:27:28,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:27:28,011 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:27:28,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2019-12-07 17:27:28,058 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data/4a1d00e0c/c99a31e603eb4ac3972009f96cb7f07f/FLAGda5f0c7c6 [2019-12-07 17:27:28,453 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:27:28,454 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/sv-benchmarks/c/float-benchs/sqrt_poly.c [2019-12-07 17:27:28,457 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data/4a1d00e0c/c99a31e603eb4ac3972009f96cb7f07f/FLAGda5f0c7c6 [2019-12-07 17:27:28,828 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/data/4a1d00e0c/c99a31e603eb4ac3972009f96cb7f07f [2019-12-07 17:27:28,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:27:28,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:27:28,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:27:28,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:27:28,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:27:28,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:28,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee22b6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28, skipping insertion in model container [2019-12-07 17:27:28,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:28,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:27:28,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:27:28,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:27:28,951 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:27:28,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:27:28,973 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:27:28,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28 WrapperNode [2019-12-07 17:27:28,973 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:27:28,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:27:28,974 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:27:28,974 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:27:28,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:28,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:29,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:27:29,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:27:29,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:27:29,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:27:29,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:29,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:29,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:29,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:29,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:29,039 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:29,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... [2019-12-07 17:27:29,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:27:29,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:27:29,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:27:29,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:27:29,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/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 [2019-12-07 17:27:29,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:27:29,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:27:33,466 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:27:33,466 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 17:27:33,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:27:33 BoogieIcfgContainer [2019-12-07 17:27:33,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:27:33,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:27:33,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:27:33,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:27:33,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:27:28" (1/3) ... [2019-12-07 17:27:33,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9f6696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:27:33, skipping insertion in model container [2019-12-07 17:27:33,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:27:28" (2/3) ... [2019-12-07 17:27:33,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9f6696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:27:33, skipping insertion in model container [2019-12-07 17:27:33,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:27:33" (3/3) ... [2019-12-07 17:27:33,474 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2019-12-07 17:27:33,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:27:33,485 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:27:33,493 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:27:33,507 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:27:33,508 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:27:33,508 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:27:33,508 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:27:33,508 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:27:33,508 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:27:33,508 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:27:33,508 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:27:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-12-07 17:27:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 17:27:33,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:33,521 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 17:27:33,521 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:33,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:33,525 INFO L82 PathProgramCache]: Analyzing trace with hash 889508713, now seen corresponding path program 1 times [2019-12-07 17:27:33,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:27:33,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590176075] [2019-12-07 17:27:33,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/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 [2019-12-07 17:27:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:35,274 WARN L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:27:35,278 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:37,459 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (= c_ULTIMATE.start_main_~S~0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (fp.add c_currentRoundingMode .cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse1) .cse0))) (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))))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2019-12-07 17:27:37,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:39,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:54,511 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1)))) .cse3) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse4) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (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 .cse4) .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)))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse5)))) .cse3) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse9 (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7) .cse9))) (fp.mul roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse10)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse7) (fp.geq .cse8 .cse9) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse9) (fp.leq .cse8 .cse7))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))))) is different from false [2019-12-07 17:28:05,175 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1)))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_1 .cse3) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse5) .cse3))) (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)))))) .cse5)) (fp.geq v_prenex_1 .cse5) (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from false [2019-12-07 17:28:07,257 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1)))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_1 .cse3) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse5) .cse3))) (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)))))) .cse5)) (fp.geq v_prenex_1 .cse5) (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from true [2019-12-07 17:28:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:07,261 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:28:09,490 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)))) is different from false [2019-12-07 17:28:11,681 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)))) is different from true [2019-12-07 17:28:11,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:13,767 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 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .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)))))) .cse0) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (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 .cse4)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse3) .cse4))) (fp.mul c_currentRoundingMode .cse5 (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)) .cse5)))))) .cse4))))) is different from false [2019-12-07 17:28:16,094 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 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .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)))))) .cse0) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (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 .cse4)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse3) .cse4))) (fp.mul c_currentRoundingMode .cse5 (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)) .cse5)))))) .cse4))))) is different from true [2019-12-07 17:28:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:16,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590176075] [2019-12-07 17:28:16,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:16,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-12-07 17:28:16,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769550652] [2019-12-07 17:28:16,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:28:16,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:28:16,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:28:16,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2019-12-07 17:28:16,120 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-12-07 17:28:18,226 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 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .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)))))) .cse0) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= ((_ 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 2.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (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 .cse4)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse3) .cse4))) (fp.mul c_currentRoundingMode .cse5 (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)) .cse5)))))) .cse4))))) is different from false [2019-12-07 17:28:20,554 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 2.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0)) (fp.leq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .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)))))) .cse0) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= ((_ 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 2.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)) (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 .cse4)) (fp.geq (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse4 (let ((.cse5 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse3) .cse4))) (fp.mul c_currentRoundingMode .cse5 (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)) .cse5)))))) .cse4))))) is different from true [2019-12-07 17:28:22,675 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (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)) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2019-12-07 17:28:24,865 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0))) (not (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)) (= ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) c_~sqrt2~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2019-12-07 17:28:26,985 WARN L838 $PredicateComparison]: unable to prove that (and (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 ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (= c_ULTIMATE.start_main_~S~0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (fp.add c_currentRoundingMode .cse0 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse1) .cse0))) (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))))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2019-12-07 17:28:29,108 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (or (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1)))) .cse3) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse4) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (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 .cse4) .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)))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse5)))) .cse3) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse9 (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7) .cse9))) (fp.mul roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse10)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse7) (fp.geq .cse8 .cse9) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse9) (fp.leq .cse8 .cse7))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) (not .cse3))) is different from false [2019-12-07 17:28:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:29,129 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-12-07 17:28:29,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:28:29,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-12-07 17:28:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:29,138 INFO L225 Difference]: With dead ends: 23 [2019-12-07 17:28:29,138 INFO L226 Difference]: Without dead ends: 7 [2019-12-07 17:28:29,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=28, Invalid=24, Unknown=14, NotChecked=144, Total=210 [2019-12-07 17:28:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-12-07 17:28:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-12-07 17:28:29,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-12-07 17:28:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6 transitions. [2019-12-07 17:28:29,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 6 transitions. Word has length 6 [2019-12-07 17:28:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:29,162 INFO L462 AbstractCegarLoop]: Abstraction has 7 states and 6 transitions. [2019-12-07 17:28:29,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:28:29,162 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2019-12-07 17:28:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 17:28:29,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:29,162 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 17:28:29,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:28:29,363 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:29,364 INFO L82 PathProgramCache]: Analyzing trace with hash 889568295, now seen corresponding path program 1 times [2019-12-07 17:28:29,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:28:29,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974933167] [2019-12-07 17:28:29,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/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 [2019-12-07 17:28:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:38,625 WARN L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:28:38,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:40,803 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (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_ULTIMATE.start_main_~S~0) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2019-12-07 17:28:40,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:42,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:58,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= 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 1.0))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse1))) (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)))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq .cse0 .cse1) (not (fp.geq ULTIMATE.start_main_~I~0 .cse2)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq .cse0 .cse2)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) .cse6) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse7)) (not (fp.leq (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))))))))) .cse7)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse8)))) .cse6))) is different from false [2019-12-07 17:29:09,114 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.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (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.geq ULTIMATE.start_main_~I~0 .cse0)))) (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)) (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)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from false [2019-12-07 17:29:11,208 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.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (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.geq ULTIMATE.start_main_~I~0 .cse0)))) (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)) (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)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from true [2019-12-07 17:29:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:11,209 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:29:13,391 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) is different from false [2019-12-07 17:29:15,531 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (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 .cse0 .cse1) (fp.geq .cse0 .cse2)))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse1))) is different from true [2019-12-07 17:29:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:17,626 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (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))))))))) .cse0) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (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)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)) (fp.leq (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))))))))) .cse2))))) is different from false [2019-12-07 17:29:19,896 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (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))))))))) .cse0) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (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)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)) (fp.leq (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))))))))) .cse2))))) is different from true [2019-12-07 17:29:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:29:19,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974933167] [2019-12-07 17:29:19,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:19,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-12-07 17:29:19,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688304637] [2019-12-07 17:29:19,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:29:19,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:29:19,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:29:19,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2019-12-07 17:29:19,900 INFO L87 Difference]: Start difference. First operand 7 states and 6 transitions. Second operand 11 states. [2019-12-07 17:29:22,007 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (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))))))))) .cse0) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (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)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)) (fp.leq (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))))))))) .cse2))))) is different from false [2019-12-07 17:29:24,276 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (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))))))))) .cse0) (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (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)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)) (fp.leq (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))))))))) .cse2))))) is different from true [2019-12-07 17:29:26,426 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0))) (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 .cse2) (fp.geq .cse1 .cse0))) (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)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2019-12-07 17:29:28,562 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0))) (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 .cse2) (fp.geq .cse1 .cse0))) (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)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2019-12-07 17:29:30,714 WARN L838 $PredicateComparison]: unable to prove that (and (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 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (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_ULTIMATE.start_main_~S~0) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2019-12-07 17:29:32,862 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (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 1.0))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse1))) (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)))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq .cse0 .cse1) (not (fp.geq ULTIMATE.start_main_~I~0 .cse2)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq .cse0 .cse2)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) .cse6) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse7)) (not (fp.leq (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))))))))) .cse7)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse8)))) .cse6)) (not .cse6))) is different from false [2019-12-07 17:29:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:32,869 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2019-12-07 17:29:32,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:29:32,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-12-07 17:29:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:32,870 INFO L225 Difference]: With dead ends: 7 [2019-12-07 17:29:32,870 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:29:32,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=28, Invalid=24, Unknown=14, NotChecked=144, Total=210 [2019-12-07 17:29:32,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:29:32,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:29:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:29:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:29:32,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-12-07 17:29:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:32,872 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:29:32,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:29:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:29:32,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:29:33,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:29:33,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:29:33,127 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:29:33,127 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 17:29:33,127 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:29:33,127 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:29:33,128 INFO L249 CegarLoopResult]: At program point L26(lines 15 27) the Hoare annotation is: true [2019-12-07 17:29:33,128 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2019-12-07 17:29:33,128 INFO L246 CegarLoopResult]: For program point L22(lines 22 23) no Hoare annotation was computed. [2019-12-07 17:29:33,128 INFO L246 CegarLoopResult]: For program point L22-2(lines 22 23) no Hoare annotation was computed. [2019-12-07 17:29:33,128 INFO L246 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2019-12-07 17:29:33,128 INFO L246 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-12-07 17:29:33,128 INFO L249 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: true [2019-12-07 17:29:33,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:29:33 BoogieIcfgContainer [2019-12-07 17:29:33,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:29:33,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:29:33,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:29:33,134 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:29:33,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:27:33" (3/4) ... [2019-12-07 17:29:33,136 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:29:33,143 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 17:29:33,143 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 17:29:33,169 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7e5f997b-9b8e-49f5-ac0c-25b03e62691b/bin/uautomizer/witness.graphml [2019-12-07 17:29:33,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:29:33,170 INFO L168 Benchmark]: Toolchain (without parser) took 124339.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -53.5 MB). Peak memory consumption was 56.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:33,170 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:29:33,171 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.00 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:33,171 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:33,172 INFO L168 Benchmark]: Boogie Preprocessor took 18.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:33,172 INFO L168 Benchmark]: RCFGBuilder took 4424.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:33,172 INFO L168 Benchmark]: TraceAbstraction took 119664.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:29:33,173 INFO L168 Benchmark]: Witness Printer took 35.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:29:33,175 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 142.00 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4424.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 119664.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 70.6 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. * Witness Printer took 35.26 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: 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: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Result: SAFE, OverallTime: 119.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12 SDtfs, 3 SDslu, 36 SDs, 0 SdLazy, 8 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 61.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 10.8s SatisfiabilityAnalysisTime, 82.2s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 8 QuantifiedInterpolants, 7315 SizeOfPredicates, 11 NumberOfNonLiveVariables, 24 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: 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...