./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c -s /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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.24-cad4683 [2019-11-15 20:02:22,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:02:22,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:02:22,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:02:22,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:02:22,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:02:22,464 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:02:22,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:02:22,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:02:22,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:02:22,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:02:22,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:02:22,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:02:22,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:02:22,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:02:22,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:02:22,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:02:22,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:02:22,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:02:22,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:02:22,495 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:02:22,496 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:02:22,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:02:22,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:02:22,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:02:22,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:02:22,504 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:02:22,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:02:22,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:02:22,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:02:22,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:02:22,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:02:22,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:02:22,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:02:22,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:02:22,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:02:22,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:02:22,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:02:22,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:02:22,514 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:02:22,515 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:02:22,515 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:02:22,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:02:22,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:02:22,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:02:22,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:02:22,546 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:02:22,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:02:22,547 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:02:22,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:02:22,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:02:22,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:02:22,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:02:22,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:02:22,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:02:22,549 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:02:22,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:02:22,550 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:02:22,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:02:22,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:02:22,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:02:22,551 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:02:22,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:02:22,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:02:22,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:02:22,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:02:22,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:02:22,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:02:22,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:02:22,560 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:02:22,560 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_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:02:22,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:02:22,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:02:22,611 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:02:22,613 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:02:22,613 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:02:22,614 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-11-15 20:02:22,689 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data/7298a8c4a/fa4ce5e182f146fb83cb6384e2963130/FLAGae9e89cdf [2019-11-15 20:02:23,152 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:02:23,153 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-11-15 20:02:23,163 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data/7298a8c4a/fa4ce5e182f146fb83cb6384e2963130/FLAGae9e89cdf [2019-11-15 20:02:23,478 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data/7298a8c4a/fa4ce5e182f146fb83cb6384e2963130 [2019-11-15 20:02:23,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:02:23,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:02:23,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:02:23,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:02:23,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:02:23,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:02:23" (1/1) ... [2019-11-15 20:02:23,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92d6d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:23, skipping insertion in model container [2019-11-15 20:02:23,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:02:23" (1/1) ... [2019-11-15 20:02:23,505 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:02:23,550 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:02:23,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:02:23,986 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:02:24,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:02:24,065 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:02:24,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24 WrapperNode [2019-11-15 20:02:24,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:02:24,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:02:24,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:02:24,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:02:24,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... [2019-11-15 20:02:24,089 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... [2019-11-15 20:02:24,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:02:24,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:02:24,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:02:24,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:02:24,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... [2019-11-15 20:02:24,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... [2019-11-15 20:02:24,154 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... [2019-11-15 20:02:24,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... [2019-11-15 20:02:24,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... [2019-11-15 20:02:24,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... [2019-11-15 20:02:24,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... [2019-11-15 20:02:24,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:02:24,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:02:24,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:02:24,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:02:24,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:02:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:02:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-15 20:02:24,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:02:24,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 20:02:24,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:02:24,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:02:24,262 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:02:24,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:02:25,121 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:02:25,121 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-15 20:02:25,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:02:25 BoogieIcfgContainer [2019-11-15 20:02:25,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:02:25,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:02:25,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:02:25,128 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:02:25,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:02:23" (1/3) ... [2019-11-15 20:02:25,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2586a45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:02:25, skipping insertion in model container [2019-11-15 20:02:25,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:24" (2/3) ... [2019-11-15 20:02:25,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2586a45d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:02:25, skipping insertion in model container [2019-11-15 20:02:25,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:02:25" (3/3) ... [2019-11-15 20:02:25,133 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d.c [2019-11-15 20:02:25,144 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:02:25,151 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:02:25,160 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:02:25,193 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:02:25,194 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:02:25,194 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:02:25,194 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:02:25,194 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:02:25,195 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:02:25,195 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:02:25,195 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:02:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-15 20:02:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:02:25,221 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:25,221 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:25,223 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:25,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:25,230 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-15 20:02:25,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:25,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252259024] [2019-11-15 20:02:25,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:25,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:25,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:25,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252259024] [2019-11-15 20:02:25,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:02:25,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:02:25,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538712729] [2019-11-15 20:02:25,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:02:25,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:02:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:02:25,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:02:25,387 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-15 20:02:25,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:25,428 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-15 20:02:25,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:02:25,429 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-15 20:02:25,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:25,446 INFO L225 Difference]: With dead ends: 212 [2019-11-15 20:02:25,447 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 20:02:25,452 INFO L600 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-11-15 20:02:25,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 20:02:25,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-15 20:02:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 20:02:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-15 20:02:25,507 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-15 20:02:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:25,508 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-15 20:02:25,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:02:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-15 20:02:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:02:25,509 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:25,510 INFO L380 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-11-15 20:02:25,510 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-15 20:02:25,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:02:25,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105510870] [2019-11-15 20:02:25,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:25,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:02:25,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:02:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:02:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:02:25,746 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:02:25,746 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:02:25,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:02:25 BoogieIcfgContainer [2019-11-15 20:02:25,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:02:25,786 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:02:25,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:02:25,790 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:02:25,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:02:25" (3/4) ... [2019-11-15 20:02:25,794 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:02:25,795 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:02:25,797 INFO L168 Benchmark]: Toolchain (without parser) took 2312.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -105.5 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:02:25,798 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:02:25,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 580.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:02:25,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.86 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-11-15 20:02:25,800 INFO L168 Benchmark]: Boogie Preprocessor took 66.53 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:02:25,801 INFO L168 Benchmark]: RCFGBuilder took 923.29 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:02:25,803 INFO L168 Benchmark]: TraceAbstraction took 660.72 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:02:25,803 INFO L168 Benchmark]: Witness Printer took 8.98 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-11-15 20:02:25,816 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 580.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.86 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 66.53 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 923.29 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: 54.6 MB). Peak memory consumption was 54.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 660.72 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: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 8.98 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. * 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.5s, 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.1s 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.24-cad4683 [2019-11-15 20:02:28,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:02:28,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:02:28,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:02:28,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:02:28,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:02:28,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:02:28,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:02:28,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:02:28,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:02:28,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:02:28,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:02:28,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:02:28,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:02:28,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:02:28,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:02:28,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:02:28,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:02:28,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:02:28,366 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:02:28,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:02:28,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:02:28,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:02:28,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:02:28,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:02:28,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:02:28,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:02:28,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:02:28,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:02:28,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:02:28,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:02:28,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:02:28,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:02:28,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:02:28,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:02:28,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:02:28,386 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:02:28,386 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:02:28,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:02:28,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:02:28,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:02:28,391 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 20:02:28,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:02:28,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:02:28,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:02:28,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:02:28,410 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:02:28,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:02:28,411 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:02:28,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:02:28,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:02:28,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:02:28,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:02:28,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:02:28,412 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 20:02:28,412 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 20:02:28,413 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:02:28,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:02:28,413 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:02:28,414 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:02:28,414 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:02:28,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:02:28,415 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:02:28,415 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:02:28,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:02:28,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:02:28,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:02:28,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:02:28,416 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 20:02:28,417 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 20:02:28,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:02:28,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 20:02:28,417 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_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:02:28,453 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:02:28,466 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:02:28,470 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:02:28,472 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:02:28,472 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:02:28,473 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-11-15 20:02:28,537 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data/1928aef8b/1eb5906bb7c74c4bb63875e7f6f17a9c/FLAG1db87e904 [2019-11-15 20:02:28,997 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:02:29,006 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/sv-benchmarks/c/float-newlib/float_req_bl_1270d.c [2019-11-15 20:02:29,015 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data/1928aef8b/1eb5906bb7c74c4bb63875e7f6f17a9c/FLAG1db87e904 [2019-11-15 20:02:29,391 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/bin/uautomizer/data/1928aef8b/1eb5906bb7c74c4bb63875e7f6f17a9c [2019-11-15 20:02:29,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:02:29,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:02:29,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:02:29,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:02:29,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:02:29,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:29,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b157855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29, skipping insertion in model container [2019-11-15 20:02:29,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:29,415 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:02:29,449 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:02:29,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:02:29,682 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:02:29,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:02:29,934 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:02:29,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29 WrapperNode [2019-11-15 20:02:29,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:02:29,937 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:02:29,937 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:02:29,937 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:02:29,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:29,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:30,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:02:30,025 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:02:30,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:02:30,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:02:30,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:30,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:30,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:30,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:30,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:30,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:30,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... [2019-11-15 20:02:30,132 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:02:30,133 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:02:30,133 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:02:30,133 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:02:30,134 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:02:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:02:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-11-15 20:02:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 20:02:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:02:30,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:02:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-15 20:02:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 20:02:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:02:36,868 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:02:36,868 INFO L284 CfgBuilder]: Removed 52 assume(true) statements. [2019-11-15 20:02:36,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:02:36 BoogieIcfgContainer [2019-11-15 20:02:36,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:02:36,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:02:36,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:02:36,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:02:36,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:02:29" (1/3) ... [2019-11-15 20:02:36,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daf2017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:02:36, skipping insertion in model container [2019-11-15 20:02:36,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:02:29" (2/3) ... [2019-11-15 20:02:36,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daf2017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:02:36, skipping insertion in model container [2019-11-15 20:02:36,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:02:36" (3/3) ... [2019-11-15 20:02:36,878 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270d.c [2019-11-15 20:02:36,889 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:02:36,897 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:02:36,909 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:02:36,938 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:02:36,938 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:02:36,939 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:02:36,939 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:02:36,939 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:02:36,940 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:02:36,940 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:02:36,940 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:02:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-11-15 20:02:36,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 20:02:36,970 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:36,971 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:02:36,974 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:36,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:36,981 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-11-15 20:02:36,991 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:02:36,991 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816646716] [2019-11-15 20:02:36,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:02:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:37,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 20:02:37,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:37,212 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:02:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:37,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816646716] [2019-11-15 20:02:37,223 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:02:37,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 20:02:37,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903541839] [2019-11-15 20:02:37,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 20:02:37,227 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:02:37,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 20:02:37,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 20:02:37,241 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-11-15 20:02:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:37,282 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-11-15 20:02:37,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 20:02:37,284 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-15 20:02:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:37,297 INFO L225 Difference]: With dead ends: 212 [2019-11-15 20:02:37,297 INFO L226 Difference]: Without dead ends: 104 [2019-11-15 20:02:37,302 INFO L600 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-11-15 20:02:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-15 20:02:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-15 20:02:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-15 20:02:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-11-15 20:02:37,353 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-11-15 20:02:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:37,354 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-11-15 20:02:37,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 20:02:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-11-15 20:02:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:02:37,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:37,356 INFO L380 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-11-15 20:02:37,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 20:02:37,574 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:37,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:37,574 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-11-15 20:02:37,576 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:02:37,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321976168] [2019-11-15 20:02:37,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:02:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:37,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:02:37,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:38,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:38,019 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:02:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:38,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321976168] [2019-11-15 20:02:38,684 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:02:38,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 20:02:38,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44481198] [2019-11-15 20:02:38,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:02:38,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:02:38,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:02:38,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:02:38,688 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 12 states. [2019-11-15 20:02:40,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:02:40,946 INFO L93 Difference]: Finished difference Result 444 states and 576 transitions. [2019-11-15 20:02:40,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 20:02:40,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-15 20:02:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:02:40,952 INFO L225 Difference]: With dead ends: 444 [2019-11-15 20:02:40,953 INFO L226 Difference]: Without dead ends: 358 [2019-11-15 20:02:40,955 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-11-15 20:02:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-15 20:02:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 113. [2019-11-15 20:02:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 20:02:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2019-11-15 20:02:40,978 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 21 [2019-11-15 20:02:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:02:40,979 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2019-11-15 20:02:40,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:02:40,979 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2019-11-15 20:02:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 20:02:40,981 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:02:40,981 INFO L380 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-11-15 20:02:41,197 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 20:02:41,198 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:02:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:02:41,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1653009985, now seen corresponding path program 1 times [2019-11-15 20:02:41,199 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:02:41,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410720392] [2019-11-15 20:02:41,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:02:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:02:41,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 20:02:41,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:02:43,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:02:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:02:43,454 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:02:45,351 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 20:02:46,682 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-11-15 20:02:48,991 WARN L191 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 20:02:50,665 WARN L191 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-11-15 20:02:52,309 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 20:03:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:05,674 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410720392] [2019-11-15 20:03:05,674 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:03:05,674 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [14, 14] imperfect sequences [] total 26 [2019-11-15 20:03:05,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422783406] [2019-11-15 20:03:05,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 20:03:05,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:03:05,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 20:03:05,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=564, Unknown=3, NotChecked=0, Total=650 [2019-11-15 20:03:05,677 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand 26 states. [2019-11-15 20:03:10,935 WARN L191 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-15 20:03:13,233 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-15 20:03:15,881 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-15 20:03:20,529 WARN L191 SmtUtils]: Spent 3.44 s on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-15 20:03:25,527 WARN L191 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-11-15 20:03:29,992 WARN L191 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2019-11-15 20:03:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:03:30,288 INFO L93 Difference]: Finished difference Result 157 states and 187 transitions. [2019-11-15 20:03:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 20:03:30,290 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 21 [2019-11-15 20:03:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:03:30,291 INFO L225 Difference]: With dead ends: 157 [2019-11-15 20:03:30,291 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 20:03:30,293 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=304, Invalid=1099, Unknown=3, NotChecked=0, Total=1406 [2019-11-15 20:03:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 20:03:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-11-15 20:03:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 20:03:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-15 20:03:30,301 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 21 [2019-11-15 20:03:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:03:30,301 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-15 20:03:30,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 20:03:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-11-15 20:03:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:03:30,303 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:03:30,303 INFO L380 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-11-15 20:03:30,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 20:03:30,518 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:03:30,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:03:30,519 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-11-15 20:03:30,519 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:03:30,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219227833] [2019-11-15 20:03:30,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:03:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:03:30,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-15 20:03:30,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:03:30,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:03:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:03:31,011 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:04:07,839 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 20:04:09,860 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-11-15 20:04:09,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-11-15 20:04:09,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219227833] [2019-11-15 20:04:09,881 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:09,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 22 [2019-11-15 20:04:09,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868629654] [2019-11-15 20:04:09,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 20:04:09,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:04:09,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 20:04:09,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=353, Unknown=18, NotChecked=38, Total=462 [2019-11-15 20:04:09,884 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 22 states. [2019-11-15 20:04:27,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:27,500 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-11-15 20:04:27,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:04:27,500 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2019-11-15 20:04:27,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:27,501 INFO L225 Difference]: With dead ends: 54 [2019-11-15 20:04:27,501 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 20:04:27,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 56.2s TimeCoverageRelationStatistics Valid=220, Invalid=750, Unknown=26, NotChecked=60, Total=1056 [2019-11-15 20:04:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 20:04:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2019-11-15 20:04:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 20:04:27,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-15 20:04:27,508 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2019-11-15 20:04:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:27,508 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-15 20:04:27,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 20:04:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-15 20:04:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:04:27,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:27,510 INFO L380 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-11-15 20:04:27,714 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 20:04:27,714 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:27,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:27,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1435475906, now seen corresponding path program 1 times [2019-11-15 20:04:27,718 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:04:27,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985502332] [2019-11-15 20:04:27,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:04:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:27,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:04:27,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:04:28,036 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:04:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:04:28,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985502332] [2019-11-15 20:04:28,289 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:28,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 20:04:28,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247283817] [2019-11-15 20:04:28,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:04:28,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:04:28,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:04:28,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:04:28,291 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 12 states. [2019-11-15 20:04:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:28,588 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-11-15 20:04:28,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:04:28,590 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-15 20:04:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:28,590 INFO L225 Difference]: With dead ends: 36 [2019-11-15 20:04:28,590 INFO L226 Difference]: Without dead ends: 27 [2019-11-15 20:04:28,591 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-15 20:04:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-15 20:04:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-15 20:04:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 20:04:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-11-15 20:04:28,595 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2019-11-15 20:04:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:28,596 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-11-15 20:04:28,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:04:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-11-15 20:04:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 20:04:28,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:04:28,597 INFO L380 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-11-15 20:04:28,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 20:04:28,798 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:04:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:04:28,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2115534276, now seen corresponding path program 1 times [2019-11-15 20:04:28,798 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 20:04:28,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31807453] [2019-11-15 20:04:28,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_910c15b1-9c26-4e90-ac41-304eec3ba489/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-11-15 20:04:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:04:28,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 20:04:28,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:04:29,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:04:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:04:29,293 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 20:04:31,961 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-11-15 20:04:33,999 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-11-15 20:04:34,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:04:34,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31807453] [2019-11-15 20:04:34,026 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:04:34,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 24 [2019-11-15 20:04:34,027 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207439201] [2019-11-15 20:04:34,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 20:04:34,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 20:04:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 20:04:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=413, Unknown=2, NotChecked=82, Total=552 [2019-11-15 20:04:34,029 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 24 states. [2019-11-15 20:04:35,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:04:35,504 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-11-15 20:04:35,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:04:35,505 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-11-15 20:04:35,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:04:35,505 INFO L225 Difference]: With dead ends: 27 [2019-11-15 20:04:35,505 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 20:04:35,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=190, Invalid=808, Unknown=2, NotChecked=122, Total=1122 [2019-11-15 20:04:35,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 20:04:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 20:04:35,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 20:04:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 20:04:35,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-15 20:04:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:04:35,507 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:04:35,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 20:04:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:04:35,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 20:04:35,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 20:04:35,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 20:04:35,852 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 156 [2019-11-15 20:04:35,955 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 198 DAG size of output: 185 [2019-11-15 20:04:38,419 WARN L191 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 156 DAG size of output: 95 [2019-11-15 20:04:50,909 WARN L191 SmtUtils]: Spent 12.49 s on a formula simplification. DAG size of input: 185 DAG size of output: 118 [2019-11-15 20:04:55,746 WARN L191 SmtUtils]: Spent 4.82 s on a formula simplification. DAG size of input: 166 DAG size of output: 102 [2019-11-15 20:04:55,799 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-11-15 20:04:55,799 INFO L443 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-11-15 20:04:55,799 INFO L443 ceAbstractionStarter]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-11-15 20:04:55,799 INFO L443 ceAbstractionStarter]: For program point L234(line 234) no Hoare annotation was computed. [2019-11-15 20:04:55,799 INFO L443 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-11-15 20:04:55,799 INFO L439 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-11-15 20:04:55,799 INFO L443 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-11-15 20:04:55,800 INFO L443 ceAbstractionStarter]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-11-15 20:04:55,800 INFO L439 ceAbstractionStarter]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-11-15 20:04:55,800 INFO L443 ceAbstractionStarter]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-11-15 20:04:55,800 INFO L446 ceAbstractionStarter]: At program point L237(lines 222 238) the Hoare annotation is: true [2019-11-15 20:04:55,800 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-11-15 20:04:55,800 INFO L443 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-11-15 20:04:55,800 INFO L443 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-11-15 20:04:55,800 INFO L439 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-11-15 20:04:55,800 INFO L443 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-11-15 20:04:55,800 INFO L443 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-11-15 20:04:55,801 INFO L439 ceAbstractionStarter]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-11-15 20:04:55,801 INFO L443 ceAbstractionStarter]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-11-15 20:04:55,801 INFO L443 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-11-15 20:04:55,801 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-11-15 20:04:55,801 INFO L439 ceAbstractionStarter]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse2 (let ((.cse6 (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (or (and .cse6 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse6 (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))))))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~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)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (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 ((_ 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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (and (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_~hb~0) (= (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_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~ha~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~b~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)))) (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse5 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse4 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) |ULTIMATE.start___ieee754_hypotf_#res|) (bvsgt (bvadd (bvneg .cse5) .cse4) (_ 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 (= 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_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (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_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))))) [2019-11-15 20:04:55,801 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-11-15 20:04:55,802 INFO L443 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-11-15 20:04:55,802 INFO L443 ceAbstractionStarter]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-11-15 20:04:55,802 INFO L443 ceAbstractionStarter]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-11-15 20:04:55,802 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-11-15 20:04:55,802 INFO L443 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-11-15 20:04:55,802 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-11-15 20:04:55,802 INFO L439 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-11-15 20:04:55,802 INFO L443 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-11-15 20:04:55,802 INFO L439 ceAbstractionStarter]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-11-15 20:04:55,802 INFO L439 ceAbstractionStarter]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-11-15 20:04:55,802 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-11-15 20:04:55,803 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-11-15 20:04:55,803 INFO L443 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-11-15 20:04:55,803 INFO L443 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-11-15 20:04:55,803 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-11-15 20:04:55,803 INFO L443 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-11-15 20:04:55,804 INFO L439 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse4 (let ((.cse9 (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (or (and .cse9 (not (bvsgt (bvadd (bvneg ULTIMATE.start___ieee754_hypotf_~hb~0) ULTIMATE.start___ieee754_hypotf_~ha~0) (_ bv251658240 32)))) (and .cse9 (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))))))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse1) .cse0) (_ 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 ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) |ULTIMATE.start___ieee754_hypotf_#res|) (bvsgt (bvadd (bvneg .cse3) .cse2) (_ 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)))))) .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_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (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_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= 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)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (let ((.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) ULTIMATE.start_isinf_float_~x) (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse7 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (and (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_~hb~0) (= (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))))) .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))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (let ((.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))) (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))))) [2019-11-15 20:04:55,804 INFO L443 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-11-15 20:04:55,804 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-11-15 20:04:55,804 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-11-15 20:04:55,804 INFO L439 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-11-15 20:04:55,804 INFO L443 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-11-15 20:04:55,804 INFO L439 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-11-15 20:04:55,804 INFO L443 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-11-15 20:04:55,804 INFO L439 ceAbstractionStarter]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-11-15 20:04:55,804 INFO L443 ceAbstractionStarter]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-11-15 20:04:55,805 INFO L443 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-11-15 20:04:55,805 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-11-15 20:04:55,805 INFO L439 ceAbstractionStarter]: 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)))))) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) [2019-11-15 20:04:55,805 INFO L443 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-11-15 20:04:55,805 INFO L443 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-11-15 20:04:55,805 INFO L443 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-11-15 20:04:55,805 INFO L439 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-11-15 20:04:55,805 INFO L443 ceAbstractionStarter]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-11-15 20:04:55,805 INFO L443 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-11-15 20:04:55,805 INFO L443 ceAbstractionStarter]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-11-15 20:04:55,806 INFO L443 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-11-15 20:04:55,806 INFO L439 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-11-15 20:04:55,806 INFO L443 ceAbstractionStarter]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-11-15 20:04:55,806 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 20:04:55,806 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-11-15 20:04:55,807 INFO L439 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-11-15 20:04:55,807 INFO L443 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-11-15 20:04:55,810 INFO L439 ceAbstractionStarter]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse7 (= (bvadd |ULTIMATE.start_isinf_float_#res| (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (let ((.cse13 (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (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))))))) (or (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_31 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_30 (_ BitVec 32))) (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse1) .cse0) (_ 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 ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) |ULTIMATE.start___ieee754_hypotf_#res|) (bvsgt (bvadd (bvneg .cse3) .cse2) (_ 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 ((.cse5 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30)) (.cse4 (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) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5)))) (bvsgt (bvadd (bvneg .cse5) .cse4) (_ 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)))))) .cse6 .cse7 (= 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_~hb~0_31 (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_31) ULTIMATE.start___ieee754_hypotf_~ha~0) (= (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_~ha~0_30 (_ BitVec 32))) (= (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_30) ULTIMATE.start___ieee754_hypotf_~hb~0))) (and (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (= ULTIMATE.start___ieee754_hypotf_~w~0 (let ((.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= (let ((.cse9 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) ULTIMATE.start_isinf_float_~x) (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (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 ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)))) (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_hypotf_#res| (let ((.cse11 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))) (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) .cse7 (and (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_~hb~0) (= (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))))) .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))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_37 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~b~0 (let ((.cse12 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_37))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))) (= (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)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))))) [2019-11-15 20:04:55,810 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-11-15 20:04:55,811 INFO L443 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-11-15 20:04:55,811 INFO L443 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-11-15 20:04:55,811 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 20:04:55,811 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-11-15 20:04:55,811 INFO L443 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-11-15 20:04:55,811 INFO L443 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-11-15 20:04:55,811 INFO L439 ceAbstractionStarter]: 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)))))) (= ULTIMATE.start___ieee754_hypotf_~y (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (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-11-15 20:04:55,811 INFO L443 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-11-15 20:04:55,811 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-11-15 20:04:55,812 INFO L439 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-11-15 20:04:55,812 INFO L443 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-11-15 20:04:55,812 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-11-15 20:04:55,812 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-11-15 20:04:55,812 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-11-15 20:04:55,812 INFO L443 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-11-15 20:04:55,813 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 20:04:55,813 INFO L443 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-11-15 20:04:55,813 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 234) no Hoare annotation was computed. [2019-11-15 20:04:55,813 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-11-15 20:04:55,813 INFO L439 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-11-15 20:04:55,814 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-11-15 20:04:55,814 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-11-15 20:04:55,814 INFO L443 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-11-15 20:04:55,814 INFO L443 ceAbstractionStarter]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-11-15 20:04:55,814 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-11-15 20:04:55,815 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-11-15 20:04:55,815 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-11-15 20:04:55,815 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-11-15 20:04:55,815 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 20:04:55,815 INFO L443 ceAbstractionStarter]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-11-15 20:04:55,815 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-11-15 20:04:55,816 INFO L443 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-11-15 20:04:55,816 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 236) no Hoare annotation was computed. [2019-11-15 20:04:55,816 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-11-15 20:04:55,816 INFO L439 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-11-15 20:04:55,816 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-11-15 20:04:55,817 INFO L443 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-11-15 20:04:55,817 INFO L439 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-11-15 20:04:55,817 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-11-15 20:04:55,824 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.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:555) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:255) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:212) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) 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-11-15 20:04:55,830 INFO L168 Benchmark]: Toolchain (without parser) took 146433.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.7 MB). Free memory was 952.3 MB in the beginning and 903.8 MB in the end (delta: 48.6 MB). Peak memory consumption was 312.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:55,831 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:04:55,831 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -215.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:55,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:55,833 INFO L168 Benchmark]: Boogie Preprocessor took 107.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:04:55,833 INFO L168 Benchmark]: RCFGBuilder took 6736.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:55,834 INFO L168 Benchmark]: TraceAbstraction took 138957.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 903.8 MB in the end (delta: 199.6 MB). Peak memory consumption was 285.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:04:55,838 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 538.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 178.3 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -215.0 MB). Peak memory consumption was 28.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 6736.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.0 MB). Peak memory consumption was 51.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 138957.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 903.8 MB in the end (delta: 199.6 MB). Peak memory consumption was 285.0 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. Received shutdown request...