./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.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_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/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 5fe31b16a9cb808afe0897c04a27b4a4516ff173 ............................................................................................................................................................................................................................................................................................................. 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_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/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 5fe31b16a9cb808afe0897c04a27b4a4516ff173 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 10:07:46,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:46,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:46,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:46,373 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:46,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:46,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:46,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:46,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:46,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:46,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:46,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:46,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:46,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:46,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:46,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:46,382 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:46,383 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:46,384 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:46,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:46,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:46,387 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:46,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:46,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:46,390 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:46,390 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:46,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:46,391 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:46,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:46,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:46,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:46,393 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:46,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:46,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:46,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:46,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:46,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:46,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:46,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:46,396 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:46,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:46,397 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:46,409 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:46,409 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:46,410 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:46,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:46,410 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:46,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:46,411 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:46,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:46,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:46,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:46,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:46,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:46,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:46,412 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:46,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:46,412 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:46,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:46,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:46,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:46,412 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:46,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:46,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:46,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:46,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:46,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:46,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:46,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:46,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:46,414 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:46,414 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_af69ef14-4d61-4fbf-82a0-fd8c381c8416/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 -> 5fe31b16a9cb808afe0897c04a27b4a4516ff173 [2019-12-07 10:07:46,524 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:46,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:46,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:46,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:46,538 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:46,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-12-07 10:07:46,580 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data/a4ed365bd/59b9b7d3fcb34616adfb0e2f291238ae/FLAG9dcddbb5a [2019-12-07 10:07:46,997 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:46,998 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-12-07 10:07:47,003 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data/a4ed365bd/59b9b7d3fcb34616adfb0e2f291238ae/FLAG9dcddbb5a [2019-12-07 10:07:47,011 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data/a4ed365bd/59b9b7d3fcb34616adfb0e2f291238ae [2019-12-07 10:07:47,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:47,014 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:47,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:47,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:47,017 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:47,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,020 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@770086bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47, skipping insertion in model container [2019-12-07 10:07:47,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:47,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:47,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:47,222 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:47,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:47,268 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:47,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47 WrapperNode [2019-12-07 10:07:47,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:47,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:47,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:47,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:47,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,284 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:47,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:47,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:47,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:47,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... [2019-12-07 10:07:47,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:47,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:47,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:47,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:47,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/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 10:07:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-12-07 10:07:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-12-07 10:07:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:47,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:07:47,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:47,762 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:47,763 INFO L287 CfgBuilder]: Removed 52 assume(true) statements. [2019-12-07 10:07:47,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:47 BoogieIcfgContainer [2019-12-07 10:07:47,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:47,764 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:47,764 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:47,766 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:47,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:47" (1/3) ... [2019-12-07 10:07:47,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4595ac24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:47, skipping insertion in model container [2019-12-07 10:07:47,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:47" (2/3) ... [2019-12-07 10:07:47,767 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4595ac24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:47, skipping insertion in model container [2019-12-07 10:07:47,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:47" (3/3) ... [2019-12-07 10:07:47,768 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d.c [2019-12-07 10:07:47,775 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:47,779 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:07:47,787 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:07:47,802 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:47,802 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:47,802 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:47,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:47,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:47,802 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:47,802 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:47,802 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-12-07 10:07:47,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:07:47,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:47,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:47,818 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:47,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,822 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-12-07 10:07:47,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458412745] [2019-12-07 10:07:47,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:47,904 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 10:07:47,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458412745] [2019-12-07 10:07:47,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:47,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:07:47,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848092664] [2019-12-07 10:07:47,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 10:07:47,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:07:47,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 10:07:47,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:07:47,918 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-12-07 10:07:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:47,937 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-12-07 10:07:47,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:07:47,938 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-12-07 10:07:47,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:47,946 INFO L225 Difference]: With dead ends: 212 [2019-12-07 10:07:47,946 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 10:07:47,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:07:47,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 10:07:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 10:07:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 10:07:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-12-07 10:07:47,976 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-12-07 10:07:47,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:47,976 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-12-07 10:07:47,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 10:07:47,976 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-12-07 10:07:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:07:47,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:47,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:47,977 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-12-07 10:07:47,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:07:47,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194628774] [2019-12-07 10:07:47,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:07:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:07:48,079 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:07:48,079 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:07:48,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:07:48 BoogieIcfgContainer [2019-12-07 10:07:48,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:07:48,103 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:07:48,103 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:07:48,103 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:07:48,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:47" (3/4) ... [2019-12-07 10:07:48,106 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 10:07:48,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:07:48,107 INFO L168 Benchmark]: Toolchain (without parser) took 1092.89 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 948.9 MB in the beginning and 1.0 GB in the end (delta: -61.7 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:48,108 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:07:48,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 254.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:48,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.33 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 10:07:48,109 INFO L168 Benchmark]: Boogie Preprocessor took 33.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:48,109 INFO L168 Benchmark]: RCFGBuilder took 422.36 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: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:48,110 INFO L168 Benchmark]: TraceAbstraction took 338.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:07:48,110 INFO L168 Benchmark]: Witness Printer took 3.06 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 10:07:48,112 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 254.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 948.9 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.33 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 33.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 422.36 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: 55.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 338.22 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 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.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 234]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = __VERIFIER_nondet_float(); [L230] float y = -1.0f / 0.0f; [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L97] COND FALSE !(hb > ha) [L104] a = x [L105] b = y VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L231] float res = __ieee754_hypotf(x, y); [L212] __int32_t ix; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L233] COND TRUE !isinf_float(res) [L234] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.2s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 139 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 10:07:49,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:49,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:49,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:49,521 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:49,522 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:49,523 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:49,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:49,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:49,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:49,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:49,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:49,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:49,528 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:49,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:49,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:49,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:49,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:49,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:49,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:49,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:49,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:49,537 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:49,537 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:49,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:49,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:49,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:49,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:49,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:49,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:49,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:49,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:49,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:49,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:49,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:49,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:49,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:49,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:49,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:49,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:49,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:49,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 10:07:49,556 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:49,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:49,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:49,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:49,557 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:49,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:49,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:49,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:49,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:49,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:49,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:49,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:49,558 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 10:07:49,558 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 10:07:49,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:49,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:49,559 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:49,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:49,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:49,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:49,559 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:49,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:49,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:49,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:49,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:49,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:49,560 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 10:07:49,560 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 10:07:49,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:49,560 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:49,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:07:49,560 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_af69ef14-4d61-4fbf-82a0-fd8c381c8416/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 -> 5fe31b16a9cb808afe0897c04a27b4a4516ff173 [2019-12-07 10:07:49,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:49,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:49,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:49,749 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:49,749 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:49,749 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-12-07 10:07:49,785 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data/efdbaca46/4ffb7c3e81a84324a16cdbef6a80beac/FLAGaf23b5327 [2019-12-07 10:07:50,241 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:50,242 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-12-07 10:07:50,247 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data/efdbaca46/4ffb7c3e81a84324a16cdbef6a80beac/FLAGaf23b5327 [2019-12-07 10:07:50,256 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/data/efdbaca46/4ffb7c3e81a84324a16cdbef6a80beac [2019-12-07 10:07:50,258 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:50,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:50,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:50,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:50,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:50,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb84b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50, skipping insertion in model container [2019-12-07 10:07:50,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:50,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:50,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:50,424 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:50,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:50,508 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:50,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50 WrapperNode [2019-12-07 10:07:50,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:50,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:50,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:50,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:50,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,524 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:50,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:50,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:50,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:50,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,573 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... [2019-12-07 10:07:50,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:50,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:50,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:50,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:50,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/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 10:07:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:50,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-12-07 10:07:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 10:07:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:50,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-12-07 10:07:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 10:07:50,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:56,086 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:56,086 INFO L287 CfgBuilder]: Removed 52 assume(true) statements. [2019-12-07 10:07:56,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:56 BoogieIcfgContainer [2019-12-07 10:07:56,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:56,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:56,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:56,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:56,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:50" (1/3) ... [2019-12-07 10:07:56,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4715f44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:56, skipping insertion in model container [2019-12-07 10:07:56,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:50" (2/3) ... [2019-12-07 10:07:56,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4715f44b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:56, skipping insertion in model container [2019-12-07 10:07:56,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:56" (3/3) ... [2019-12-07 10:07:56,092 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d.c [2019-12-07 10:07:56,098 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:56,103 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 10:07:56,111 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 10:07:56,126 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:56,126 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:56,126 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:56,126 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:56,127 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:56,127 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:56,127 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:56,127 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-12-07 10:07:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:07:56,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:56,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:56,143 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:56,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:56,147 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-12-07 10:07:56,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:56,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916832845] [2019-12-07 10:07:56,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/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 10:07:56,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:56,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 10:07:56,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:56,289 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 10:07:56,289 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:56,292 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 10:07:56,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916832845] [2019-12-07 10:07:56,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:56,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 10:07:56,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810791477] [2019-12-07 10:07:56,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 10:07:56,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:56,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 10:07:56,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:07:56,308 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-12-07 10:07:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:56,328 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-12-07 10:07:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 10:07:56,329 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-12-07 10:07:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:56,337 INFO L225 Difference]: With dead ends: 212 [2019-12-07 10:07:56,337 INFO L226 Difference]: Without dead ends: 104 [2019-12-07 10:07:56,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 10:07:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-07 10:07:56,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-07 10:07:56,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-07 10:07:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-12-07 10:07:56,369 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-12-07 10:07:56,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:56,369 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-12-07 10:07:56,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 10:07:56,369 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-12-07 10:07:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:07:56,370 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:56,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:56,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 10:07:56,572 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:56,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:56,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-12-07 10:07:56,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:56,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366097461] [2019-12-07 10:07:56,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/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 10:07:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:56,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 10:07:56,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:07:56,979 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 10:07:56,979 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:07:57,390 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 10:07:57,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366097461] [2019-12-07 10:07:57,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:07:57,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 10:07:57,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109387598] [2019-12-07 10:07:57,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:07:57,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:07:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:07:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:07:57,394 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 12 states. [2019-12-07 10:07:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:07:59,333 INFO L93 Difference]: Finished difference Result 444 states and 576 transitions. [2019-12-07 10:07:59,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:07:59,335 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-12-07 10:07:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:07:59,338 INFO L225 Difference]: With dead ends: 444 [2019-12-07 10:07:59,339 INFO L226 Difference]: Without dead ends: 358 [2019-12-07 10:07:59,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:07:59,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-12-07 10:07:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 113. [2019-12-07 10:07:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 10:07:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2019-12-07 10:07:59,359 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 21 [2019-12-07 10:07:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:07:59,359 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2019-12-07 10:07:59,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:07:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2019-12-07 10:07:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:07:59,360 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:07:59,360 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:07:59,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 10:07:59,562 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:07:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:07:59,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1653009985, now seen corresponding path program 1 times [2019-12-07 10:07:59,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:07:59,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307465926] [2019-12-07 10:07:59,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 10:07:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:07:59,726 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 10:07:59,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:00,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:01,060 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 10:08:01,060 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:08:02,334 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-12-07 10:08:03,477 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-12-07 10:08:05,125 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 10:08:06,652 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 10:08:08,256 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 10:08:19,370 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 10:08:19,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307465926] [2019-12-07 10:08:19,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:19,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 27 [2019-12-07 10:08:19,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615553543] [2019-12-07 10:08:19,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 10:08:19,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:08:19,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 10:08:19,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=607, Unknown=3, NotChecked=0, Total=702 [2019-12-07 10:08:19,372 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand 27 states. [2019-12-07 10:08:22,364 WARN L192 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-07 10:08:24,143 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-07 10:08:26,190 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2019-12-07 10:08:30,005 WARN L192 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-12-07 10:08:34,355 WARN L192 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-12-07 10:08:38,260 WARN L192 SmtUtils]: Spent 3.22 s on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 10:08:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:38,388 INFO L93 Difference]: Finished difference Result 157 states and 187 transitions. [2019-12-07 10:08:38,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 10:08:38,388 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 21 [2019-12-07 10:08:38,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:38,389 INFO L225 Difference]: With dead ends: 157 [2019-12-07 10:08:38,389 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 10:08:38,390 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=325, Invalid=1154, Unknown=3, NotChecked=0, Total=1482 [2019-12-07 10:08:38,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 10:08:38,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-12-07 10:08:38,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 10:08:38,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-12-07 10:08:38,393 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2019-12-07 10:08:38,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:38,394 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-12-07 10:08:38,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 10:08:38,394 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-12-07 10:08:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:08:38,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:38,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:38,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 10:08:38,595 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:38,596 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-12-07 10:08:38,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:08:38,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514847567] [2019-12-07 10:08:38,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 10:08:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:38,726 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 10:08:38,729 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:39,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:39,108 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 10:08:39,108 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:08:41,632 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)) (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2019-12-07 10:08:43,647 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_2_5 (_ BitVec 32)) (v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= c_ULTIMATE.start___ieee754_hypotf_~y (fp ((_ extract 31 31) v_skolemized_v_prenex_2_5) ((_ extract 30 23) v_skolemized_v_prenex_2_5) ((_ extract 22 0) v_skolemized_v_prenex_2_5)))) (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)) (let ((.cse0 (bvand (_ bv2147483647 32) v_skolemized_v_prenex_2_5))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))))) is different from false [2019-12-07 10:08:43,660 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 10:08:43,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514847567] [2019-12-07 10:08:43,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:43,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-12-07 10:08:43,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72135025] [2019-12-07 10:08:43,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 10:08:43,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:08:43,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 10:08:43,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=336, Unknown=2, NotChecked=74, Total=462 [2019-12-07 10:08:43,661 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 22 states. [2019-12-07 10:08:45,808 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2019-12-07 10:08:47,619 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 10:08:47,857 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 10:08:48,069 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 10:08:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:48,083 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-12-07 10:08:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 10:08:48,083 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-12-07 10:08:48,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:48,084 INFO L225 Difference]: With dead ends: 54 [2019-12-07 10:08:48,084 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 10:08:48,085 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=207, Invalid=729, Unknown=2, NotChecked=118, Total=1056 [2019-12-07 10:08:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 10:08:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-12-07 10:08:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 10:08:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-12-07 10:08:48,088 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2019-12-07 10:08:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:48,089 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-12-07 10:08:48,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 10:08:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-12-07 10:08:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:08:48,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:48,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:48,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 10:08:48,291 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:48,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:48,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1435475906, now seen corresponding path program 1 times [2019-12-07 10:08:48,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:08:48,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403361630] [2019-12-07 10:08:48,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 10:08:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:48,453 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 10:08:48,455 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:48,678 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 10:08:48,679 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:08:48,880 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 10:08:48,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403361630] [2019-12-07 10:08:48,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:48,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 10:08:48,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643181424] [2019-12-07 10:08:48,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:08:48,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:08:48,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:08:48,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:08:48,882 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 12 states. [2019-12-07 10:08:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:49,304 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-12-07 10:08:49,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:08:49,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-12-07 10:08:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:49,306 INFO L225 Difference]: With dead ends: 36 [2019-12-07 10:08:49,306 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 10:08:49,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-07 10:08:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 10:08:49,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-12-07 10:08:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 10:08:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-12-07 10:08:49,310 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2019-12-07 10:08:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:49,311 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-12-07 10:08:49,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:08:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-12-07 10:08:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:08:49,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:49,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:49,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 10:08:49,514 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:08:49,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:49,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2115534276, now seen corresponding path program 1 times [2019-12-07 10:08:49,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 10:08:49,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985239126] [2019-12-07 10:08:49,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_af69ef14-4d61-4fbf-82a0-fd8c381c8416/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 10:08:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:49,667 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 10:08:49,671 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:08:50,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 10:08:50,179 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 10:08:50,179 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:08:52,938 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)) (let ((.cse0 (bvand (_ bv2147483647 32) c_ULTIMATE.start___ieee754_hypotf_~hb~0))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5) (_ bv2155872256 32)) (_ bv0 32)))) is different from false [2019-12-07 10:08:54,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_skolemized_v_prenex_2_7 (_ BitVec 32)) (v_skolemized_v_prenex_5_5 (_ BitVec 32))) (or (not (= (fp ((_ extract 31 31) v_skolemized_v_prenex_5_5) ((_ extract 30 23) v_skolemized_v_prenex_5_5) ((_ extract 22 0) v_skolemized_v_prenex_5_5)) (let ((.cse0 (bvand (_ bv2147483647 32) v_skolemized_v_prenex_2_7))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))))) (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_5) (_ bv2155872256 32)) (_ bv0 32)) (not (= c_ULTIMATE.start___ieee754_hypotf_~y (fp ((_ extract 31 31) v_skolemized_v_prenex_2_7) ((_ extract 30 23) v_skolemized_v_prenex_2_7) ((_ extract 22 0) v_skolemized_v_prenex_2_7)))))) is different from false [2019-12-07 10:08:54,963 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 10:08:54,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985239126] [2019-12-07 10:08:54,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:54,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 24 [2019-12-07 10:08:54,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605580811] [2019-12-07 10:08:54,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 10:08:54,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 10:08:54,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 10:08:54,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=413, Unknown=2, NotChecked=82, Total=552 [2019-12-07 10:08:54,965 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 24 states. [2019-12-07 10:08:57,092 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 37 DAG size of output: 9 [2019-12-07 10:08:58,953 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-12-07 10:08:59,166 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-12-07 10:08:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:59,166 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-12-07 10:08:59,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:08:59,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-12-07 10:08:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:59,167 INFO L225 Difference]: With dead ends: 27 [2019-12-07 10:08:59,167 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 10:08:59,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=204, Invalid=858, Unknown=2, NotChecked=126, Total=1190 [2019-12-07 10:08:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 10:08:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 10:08:59,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 10:08:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 10:08:59,168 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-12-07 10:08:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:59,168 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 10:08:59,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 10:08:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 10:08:59,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 10:08:59,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 10:08:59,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 10:08:59,477 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 164 [2019-12-07 10:09:03,682 WARN L192 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 164 DAG size of output: 102 [2019-12-07 10:09:15,956 WARN L192 SmtUtils]: Spent 12.27 s on a formula simplification. DAG size of input: 195 DAG size of output: 127 [2019-12-07 10:09:21,381 WARN L192 SmtUtils]: Spent 5.37 s on a formula simplification. DAG size of input: 174 DAG size of output: 109 [2019-12-07 10:09:21,456 INFO L246 CegarLoopResult]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L234(line 234) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L242 CegarLoopResult]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L242 CegarLoopResult]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L249 CegarLoopResult]: At program point L237(lines 222 238) the Hoare annotation is: true [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L246 CegarLoopResult]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-12-07 10:09:21,457 INFO L242 CegarLoopResult]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-12-07 10:09:21,458 INFO L246 CegarLoopResult]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-12-07 10:09:21,458 INFO L246 CegarLoopResult]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-12-07 10:09:21,458 INFO L242 CegarLoopResult]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-12-07 10:09:21,458 INFO L246 CegarLoopResult]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-12-07 10:09:21,458 INFO L246 CegarLoopResult]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-12-07 10:09:21,458 INFO L246 CegarLoopResult]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-12-07 10:09:21,458 INFO L242 CegarLoopResult]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse2 (let ((.cse7 (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~y)))) (or (and .cse7 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse7 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ULTIMATE.start___ieee754_hypotf_~ha~0)))))) (.cse4 (= currentRoundingMode roundNearestTiesToEven))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (let ((.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~hb~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) .cse4 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse5 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) |ULTIMATE.start___ieee754_hypotf_#res|) (bvsgt (bvadd (bvneg .cse6) .cse5) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) .cse2 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))))) .cse4 (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))))) [2019-12-07 10:09:21,458 INFO L246 CegarLoopResult]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-12-07 10:09:21,458 INFO L246 CegarLoopResult]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-12-07 10:09:21,458 INFO L246 CegarLoopResult]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-12-07 10:09:21,458 INFO L246 CegarLoopResult]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L242 CegarLoopResult]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L242 CegarLoopResult]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-12-07 10:09:21,459 INFO L242 CegarLoopResult]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-12-07 10:09:21,459 INFO L246 CegarLoopResult]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-12-07 10:09:21,460 INFO L242 CegarLoopResult]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse3 (let ((.cse10 (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~y)))) (or (and .cse10 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse10 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ULTIMATE.start___ieee754_hypotf_~ha~0)))))) (.cse5 (= currentRoundingMode roundNearestTiesToEven))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (let ((.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ULTIMATE.start_isinf_float_~x) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) .cse3 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~hb~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse4 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))) .cse5 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse7 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse7) .cse6) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse9 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) |ULTIMATE.start___ieee754_hypotf_#res|) (bvsgt (bvadd (bvneg .cse9) .cse8) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) .cse3 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))))) .cse5 (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))))) [2019-12-07 10:09:21,460 INFO L246 CegarLoopResult]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-12-07 10:09:21,460 INFO L246 CegarLoopResult]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-12-07 10:09:21,460 INFO L246 CegarLoopResult]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-12-07 10:09:21,460 INFO L242 CegarLoopResult]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-12-07 10:09:21,460 INFO L246 CegarLoopResult]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-12-07 10:09:21,460 INFO L242 CegarLoopResult]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-12-07 10:09:21,460 INFO L246 CegarLoopResult]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-12-07 10:09:21,460 INFO L242 CegarLoopResult]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-12-07 10:09:21,460 INFO L246 CegarLoopResult]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-12-07 10:09:21,461 INFO L246 CegarLoopResult]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-12-07 10:09:21,461 INFO L246 CegarLoopResult]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-12-07 10:09:21,461 INFO L242 CegarLoopResult]: At program point L85-2(lines 85 89) the Hoare annotation is: (and (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~y) (= currentRoundingMode roundNearestTiesToEven)) [2019-12-07 10:09:21,461 INFO L246 CegarLoopResult]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-12-07 10:09:21,461 INFO L246 CegarLoopResult]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-12-07 10:09:21,461 INFO L246 CegarLoopResult]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-12-07 10:09:21,461 INFO L242 CegarLoopResult]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-12-07 10:09:21,461 INFO L246 CegarLoopResult]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-12-07 10:09:21,462 INFO L246 CegarLoopResult]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-12-07 10:09:21,462 INFO L246 CegarLoopResult]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-12-07 10:09:21,462 INFO L246 CegarLoopResult]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-12-07 10:09:21,462 INFO L242 CegarLoopResult]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-12-07 10:09:21,462 INFO L246 CegarLoopResult]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-12-07 10:09:21,462 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 10:09:21,462 INFO L246 CegarLoopResult]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-12-07 10:09:21,462 INFO L242 CegarLoopResult]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-12-07 10:09:21,462 INFO L246 CegarLoopResult]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-12-07 10:09:21,463 INFO L242 CegarLoopResult]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse4 (let ((.cse13 (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~y)))) (or (and .cse13 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse13 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_26 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_26) ULTIMATE.start___ieee754_hypotf_~ha~0)))))) (.cse6 (= currentRoundingMode roundNearestTiesToEven))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (let ((.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) (= (_ bv0 32) (bvadd |ULTIMATE.start_isinf_float_#res| (_ bv4294967295 32))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ULTIMATE.start_isinf_float_~x) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))))) .cse4 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~hb~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse5 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))))) .cse6 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse7 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse8) .cse7) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse9 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) |ULTIMATE.start___ieee754_hypotf_#res|) (bvsgt (bvadd (bvneg .cse10) .cse9) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse12 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse11 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (bvsgt (bvadd (bvneg .cse12) .cse11) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (= |ULTIMATE.start_isinf_float_#res| (_ bv1 32)) .cse4 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))))) .cse6 (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0))) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))))) [2019-12-07 10:09:21,463 INFO L246 CegarLoopResult]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-12-07 10:09:21,463 INFO L246 CegarLoopResult]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-12-07 10:09:21,463 INFO L246 CegarLoopResult]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-12-07 10:09:21,464 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 10:09:21,464 INFO L246 CegarLoopResult]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-12-07 10:09:21,464 INFO L246 CegarLoopResult]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-12-07 10:09:21,464 INFO L246 CegarLoopResult]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-12-07 10:09:21,464 INFO L242 CegarLoopResult]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (forall ((v_skolemized_v_prenex_5_4 (_ BitVec 32))) (or (= (bvadd (bvand (_ bv2147483647 32) v_skolemized_v_prenex_5_4) (_ bv2155872256 32)) (_ bv0 32)) (not (= ULTIMATE.start___ieee754_hypotf_~b~0 (fp ((_ extract 31 31) v_skolemized_v_prenex_5_4) ((_ extract 30 23) v_skolemized_v_prenex_5_4) ((_ extract 22 0) v_skolemized_v_prenex_5_4)))))) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) ULTIMATE.start___ieee754_hypotf_~y) (= currentRoundingMode roundNearestTiesToEven) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) [2019-12-07 10:09:21,464 INFO L246 CegarLoopResult]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-12-07 10:09:21,464 INFO L246 CegarLoopResult]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-12-07 10:09:21,464 INFO L242 CegarLoopResult]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-12-07 10:09:21,464 INFO L246 CegarLoopResult]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-12-07 10:09:21,465 INFO L246 CegarLoopResult]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-12-07 10:09:21,465 INFO L246 CegarLoopResult]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-12-07 10:09:21,465 INFO L246 CegarLoopResult]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-12-07 10:09:21,465 INFO L246 CegarLoopResult]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-12-07 10:09:21,465 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 10:09:21,465 INFO L246 CegarLoopResult]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-12-07 10:09:21,465 INFO L246 CegarLoopResult]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-12-07 10:09:21,465 INFO L242 CegarLoopResult]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-12-07 10:09:21,465 INFO L246 CegarLoopResult]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-12-07 10:09:21,465 INFO L246 CegarLoopResult]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 234) no Hoare annotation was computed. [2019-12-07 10:09:21,466 INFO L246 CegarLoopResult]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-12-07 10:09:21,467 INFO L246 CegarLoopResult]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-12-07 10:09:21,467 INFO L246 CegarLoopResult]: For program point L233(lines 233 236) no Hoare annotation was computed. [2019-12-07 10:09:21,467 INFO L246 CegarLoopResult]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-12-07 10:09:21,467 INFO L242 CegarLoopResult]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-12-07 10:09:21,467 INFO L246 CegarLoopResult]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-12-07 10:09:21,467 INFO L246 CegarLoopResult]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-12-07 10:09:21,467 INFO L242 CegarLoopResult]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-12-07 10:09:21,467 INFO L246 CegarLoopResult]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-12-07 10:09:21,473 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 10:09:21,475 INFO L168 Benchmark]: Toolchain (without parser) took 91216.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 952.4 MB in the beginning and 815.7 MB in the end (delta: 136.6 MB). Peak memory consumption was 328.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:21,476 INFO L168 Benchmark]: CDTParser took 0.14 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 10:09:21,476 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:21,476 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:09:21,477 INFO L168 Benchmark]: Boogie Preprocessor took 38.17 ms. Allocated memory is still 1.2 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 10:09:21,477 INFO L168 Benchmark]: RCFGBuilder took 5500.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:21,478 INFO L168 Benchmark]: TraceAbstraction took 85386.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.0 GB in the beginning and 815.7 MB in the end (delta: 232.9 MB). Peak memory consumption was 292.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:09:21,480 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.14 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 249.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 27.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.17 ms. Allocated memory is still 1.2 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 5500.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 85386.48 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.0 GB in the beginning and 815.7 MB in the end (delta: 232.9 MB). Peak memory consumption was 292.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 234]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...