./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94c7e44bedb585ab09170efda1a99dc421396ccb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94c7e44bedb585ab09170efda1a99dc421396ccb ............................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 09:37:56,854 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:37:56,856 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:37:56,863 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:37:56,863 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:37:56,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:37:56,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:37:56,865 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:37:56,866 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:37:56,867 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:37:56,867 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:37:56,868 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:37:56,868 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:37:56,869 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:37:56,869 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:37:56,870 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:37:56,870 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:37:56,871 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:37:56,873 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:37:56,874 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:37:56,874 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:37:56,875 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:37:56,877 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:37:56,877 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:37:56,877 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:37:56,878 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:37:56,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:37:56,879 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:37:56,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:37:56,880 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:37:56,880 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:37:56,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:37:56,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:37:56,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:37:56,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:37:56,882 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:37:56,882 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 09:37:56,890 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:37:56,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:37:56,891 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:37:56,891 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 09:37:56,892 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:37:56,892 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:37:56,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:37:56,892 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:37:56,892 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:37:56,893 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:37:56,893 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:37:56,893 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:37:56,893 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:37:56,893 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:37:56,893 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:37:56,893 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:37:56,893 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:37:56,894 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:37:56,894 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 09:37:56,894 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 09:37:56,894 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:37:56,894 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:37:56,894 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 09:37:56,895 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:37:56,895 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:37:56,895 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:37:56,895 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 09:37:56,895 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:37:56,895 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:37:56,895 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak 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 -> Kojak 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 -> 94c7e44bedb585ab09170efda1a99dc421396ccb [2018-11-23 09:37:56,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:37:56,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:37:56,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:37:56,931 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:37:56,931 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:37:56,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-23 09:37:56,973 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data/0c867b5ca/7af8a6d168164ec584b648f45674a093/FLAGb2c88b8bd [2018-11-23 09:37:57,369 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:37:57,369 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-23 09:37:57,373 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data/0c867b5ca/7af8a6d168164ec584b648f45674a093/FLAGb2c88b8bd [2018-11-23 09:37:57,381 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data/0c867b5ca/7af8a6d168164ec584b648f45674a093 [2018-11-23 09:37:57,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:37:57,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:37:57,384 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:37:57,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:37:57,387 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:37:57,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13647ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57, skipping insertion in model container [2018-11-23 09:37:57,389 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:37:57,407 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:37:57,520 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:37:57,523 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:37:57,537 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:37:57,551 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:37:57,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57 WrapperNode [2018-11-23 09:37:57,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:37:57,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:37:57,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:37:57,552 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:37:57,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:37:57,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:37:57,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:37:57,577 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:37:57,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:37:57,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:37:57,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:37:57,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:37:57,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:37:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 09:37:57,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 09:37:57,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 09:37:57,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 09:37:57,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:37:57,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:37:57,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:37:57,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 09:37:57,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:37:57,850 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:37:57,850 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 09:37:57,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:37:57 BoogieIcfgContainer [2018-11-23 09:37:57,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:37:57,851 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 09:37:57,851 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 09:37:57,859 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 09:37:57,859 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:37:57" (1/1) ... [2018-11-23 09:37:57,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:37:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:37:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 09:37:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 09:37:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 09:37:57,898 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:37:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:37:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:37:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:37:58,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 8 states and 10 transitions. [2018-11-23 09:37:58,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-11-23 09:37:58,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 09:37:58,038 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:37:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:37:58,124 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0;havoc main_~a~0;havoc main_~r~0;main_~a~0 := main_#t~nondet4;havoc main_#t~nondet4;assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0);inv_#in~A := main_~a~0;havoc inv_#res;havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0.base, inv_~#A_u~0.offset, inv_~#xi_u~0.base, inv_~#xi_u~0.offset;inv_~A := inv_#in~A;havoc inv_~xi~0;havoc inv_~xsi~0;havoc inv_~temp~0;havoc inv_~cond~0;havoc inv_~exp~0;call inv_~#A_u~0.base, inv_~#A_u~0.offset := #Ultimate.alloc(8);call inv_~#xi_u~0.base, inv_~#xi_u~0.offset := #Ultimate.alloc(8);call write~real(inv_~A, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8);call inv_#t~mem0 := read~int(inv_~#A_u~0.base, inv_~#A_u~0.offset, 8);inv_~exp~0 := (if ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023;call write~real(inv_#t~union1, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8);havoc inv_#t~mem0;havoc inv_#t~union1;call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8);call write~int(4503599627370496 * (1023 - inv_~exp~0), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8);call inv_#t~mem2 := read~real(inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8);inv_~xi~0 := inv_#t~mem2;call write~int(inv_#t~union3, inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8);havoc inv_#t~mem2;havoc inv_#t~union3;inv_~cond~0 := 1; VAL [ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=1, ULTIMATE.start_inv_~exp~0=5260, ULTIMATE.start_inv_~xi~0=3.0, ULTIMATE.start_main_~a~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_~#A_u~0.base|=2, |ULTIMATE.start_inv_~#A_u~0.offset|=0, |ULTIMATE.start_inv_~#xi_u~0.base|=4, |ULTIMATE.start_inv_~#xi_u~0.offset|=0] [?] assume !!(0 != inv_~cond~0);inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0));inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0);inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0);inv_~xi~0 := inv_~xsi~0; VAL [ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=0, ULTIMATE.start_inv_~exp~0=5260, ULTIMATE.start_inv_~xi~0=4.0, ULTIMATE.start_inv_~xsi~0=4.0, ULTIMATE.start_main_~a~0=1.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_~#A_u~0.base|=2, |ULTIMATE.start_inv_~#A_u~0.offset|=0, |ULTIMATE.start_inv_~#xi_u~0.base|=4, |ULTIMATE.start_inv_~#xi_u~0.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(0 != inv_~cond~0);}EndParallelCompositioninv_#res := inv_~xi~0;call ULTIMATE.dealloc(inv_~#A_u~0.base, inv_~#A_u~0.offset);havoc inv_~#A_u~0.base, inv_~#A_u~0.offset;call ULTIMATE.dealloc(inv_~#xi_u~0.base, inv_~#xi_u~0.offset);havoc inv_~#xi_u~0.base, inv_~#xi_u~0.offset;main_#t~ret5 := inv_#res;main_~r~0 := main_#t~ret5;havoc main_#t~ret5;__VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=0, ULTIMATE.start_inv_~exp~0=5260, ULTIMATE.start_inv_~xi~0=4.0, ULTIMATE.start_inv_~xsi~0=4.0, ULTIMATE.start_main_~a~0=1.0, ULTIMATE.start_main_~r~0=4.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_#res|=4.0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=0, ULTIMATE.start_inv_~exp~0=5260, ULTIMATE.start_inv_~xi~0=4.0, ULTIMATE.start_inv_~xsi~0=4.0, ULTIMATE.start_main_~a~0=1.0, ULTIMATE.start_main_~r~0=4.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_#res|=4.0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_inv_~A=1.0, ULTIMATE.start_inv_~cond~0=0, ULTIMATE.start_inv_~exp~0=5260, ULTIMATE.start_inv_~xi~0=4.0, ULTIMATE.start_inv_~xsi~0=4.0, ULTIMATE.start_main_~a~0=1.0, ULTIMATE.start_main_~r~0=4.0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_inv_#in~A|=1.0, |ULTIMATE.start_inv_#res|=4.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L41] havoc main_~a~0; [L41] havoc main_~r~0; [L43] main_~a~0 := main_#t~nondet4; [L43] havoc main_#t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0); [L46] inv_#in~A := main_~a~0; [L46] havoc inv_#res; [L46] havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0.base, inv_~#A_u~0.offset, inv_~#xi_u~0.base, inv_~#xi_u~0.offset; [L19-L37] inv_~A := inv_#in~A; [L21] havoc inv_~xi~0; [L21] havoc inv_~xsi~0; [L21] havoc inv_~temp~0; [L22] havoc inv_~cond~0; [L22] havoc inv_~exp~0; [L23] call inv_~#A_u~0.base, inv_~#A_u~0.offset := #Ultimate.alloc(8); [L23] call inv_~#xi_u~0.base, inv_~#xi_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(inv_~A, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L25] call inv_#t~mem0 := read~int(inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L25] inv_~exp~0 := (if ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] call write~real(inv_#t~union1, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L25] havoc inv_#t~mem0; [L25] havoc inv_#t~union1; [L26] call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L27] call write~int(4503599627370496 * (1023 - inv_~exp~0), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L28] call inv_#t~mem2 := read~real(inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L28] inv_~xi~0 := inv_#t~mem2; [L28] call write~int(inv_#t~union3, inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L28] havoc inv_#t~mem2; [L28] havoc inv_#t~union3; [L29] inv_~cond~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, inv_#in~A=1.0, inv_~#A_u~0.base=2, inv_~#A_u~0.offset=0, inv_~#xi_u~0.base=4, inv_~#xi_u~0.offset=0, inv_~A=1.0, inv_~cond~0=1, inv_~exp~0=5260, inv_~xi~0=3.0, main_~a~0=1.0] [L30-L35] assume !!(0 != inv_~cond~0); [L31] inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0)); [L32] inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0); [L33] inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] inv_~xi~0 := inv_~xsi~0; VAL [#NULL.base=0, #NULL.offset=0, inv_#in~A=1.0, inv_~#A_u~0.base=2, inv_~#A_u~0.offset=0, inv_~#xi_u~0.base=4, inv_~#xi_u~0.offset=0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0] [L30-L35] assume !(0 != inv_~cond~0); [L36] inv_#res := inv_~xi~0; [L23] call ULTIMATE.dealloc(inv_~#A_u~0.base, inv_~#A_u~0.offset); [L36] havoc inv_~#A_u~0.base, inv_~#A_u~0.offset; [L23] call ULTIMATE.dealloc(inv_~#xi_u~0.base, inv_~#xi_u~0.offset); [L36] havoc inv_~#xi_u~0.base, inv_~#xi_u~0.offset; [L46] main_#t~ret5 := inv_#res; [L46] main_~r~0 := main_#t~ret5; [L46] havoc main_#t~ret5; [L48] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0); [L48] havoc __VERIFIER_assert_~cond; [L11] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L11] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L11] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L41] havoc main_~a~0; [L41] havoc main_~r~0; [L43] main_~a~0 := main_#t~nondet4; [L43] havoc main_#t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0); [L46] inv_#in~A := main_~a~0; [L46] havoc inv_#res; [L46] havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0.base, inv_~#A_u~0.offset, inv_~#xi_u~0.base, inv_~#xi_u~0.offset; [L19-L37] inv_~A := inv_#in~A; [L21] havoc inv_~xi~0; [L21] havoc inv_~xsi~0; [L21] havoc inv_~temp~0; [L22] havoc inv_~cond~0; [L22] havoc inv_~exp~0; [L23] call inv_~#A_u~0.base, inv_~#A_u~0.offset := #Ultimate.alloc(8); [L23] call inv_~#xi_u~0.base, inv_~#xi_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(inv_~A, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L25] call inv_#t~mem0 := read~int(inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L25] inv_~exp~0 := (if ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] call write~real(inv_#t~union1, inv_~#A_u~0.base, inv_~#A_u~0.offset, 8); [L25] havoc inv_#t~mem0; [L25] havoc inv_#t~union1; [L26] call write~real(~convertINTToDOUBLE(1), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L27] call write~int(4503599627370496 * (1023 - inv_~exp~0), inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L28] call inv_#t~mem2 := read~real(inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L28] inv_~xi~0 := inv_#t~mem2; [L28] call write~int(inv_#t~union3, inv_~#xi_u~0.base, inv_~#xi_u~0.offset, 8); [L28] havoc inv_#t~mem2; [L28] havoc inv_#t~union3; [L29] inv_~cond~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, inv_#in~A=1.0, inv_~#A_u~0.base=2, inv_~#A_u~0.offset=0, inv_~#xi_u~0.base=4, inv_~#xi_u~0.offset=0, inv_~A=1.0, inv_~cond~0=1, inv_~exp~0=5260, inv_~xi~0=3.0, main_~a~0=1.0] [L30-L35] assume !!(0 != inv_~cond~0); [L31] inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0)); [L32] inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0); [L33] inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] inv_~xi~0 := inv_~xsi~0; VAL [#NULL.base=0, #NULL.offset=0, inv_#in~A=1.0, inv_~#A_u~0.base=2, inv_~#A_u~0.offset=0, inv_~#xi_u~0.base=4, inv_~#xi_u~0.offset=0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0] [L30-L35] assume !(0 != inv_~cond~0); [L36] inv_#res := inv_~xi~0; [L23] call ULTIMATE.dealloc(inv_~#A_u~0.base, inv_~#A_u~0.offset); [L36] havoc inv_~#A_u~0.base, inv_~#A_u~0.offset; [L23] call ULTIMATE.dealloc(inv_~#xi_u~0.base, inv_~#xi_u~0.offset); [L36] havoc inv_~#xi_u~0.base, inv_~#xi_u~0.offset; [L46] main_#t~ret5 := inv_#res; [L46] main_~r~0 := main_#t~ret5; [L46] havoc main_#t~ret5; [L48] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0); [L48] havoc __VERIFIER_assert_~cond; [L11] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L11] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L11] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L41] havoc main_~a~0; [L41] havoc main_~r~0; [L43] main_~a~0 := main_#t~nondet4; [L43] havoc main_#t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0); [L46] inv_#in~A := main_~a~0; [L46] havoc inv_#res; [L46] havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0, inv_~#xi_u~0; [L19-L37] inv_~A := inv_#in~A; [L21] havoc inv_~xi~0; [L21] havoc inv_~xsi~0; [L21] havoc inv_~temp~0; [L22] havoc inv_~cond~0; [L22] havoc inv_~exp~0; [L23] FCALL call inv_~#A_u~0 := #Ultimate.alloc(8); [L23] FCALL call inv_~#xi_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(inv_~A, { base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L25] FCALL call inv_#t~mem0 := read~int({ base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L25] inv_~exp~0 := (if ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] FCALL call write~real(inv_#t~union1, { base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L25] havoc inv_#t~mem0; [L25] havoc inv_#t~union1; [L26] FCALL call write~real(~convertINTToDOUBLE(1), { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L27] FCALL call write~int(4503599627370496 * (1023 - inv_~exp~0), { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L28] FCALL call inv_#t~mem2 := read~real({ base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L28] inv_~xi~0 := inv_#t~mem2; [L28] FCALL call write~int(inv_#t~union3, { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L28] havoc inv_#t~mem2; [L28] havoc inv_#t~union3; [L29] inv_~cond~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, inv_#in~A=1.0, inv_~#A_u~0!base=2, inv_~#A_u~0!offset=0, inv_~#xi_u~0!base=4, inv_~#xi_u~0!offset=0, inv_~A=1.0, inv_~cond~0=1, inv_~exp~0=5260, inv_~xi~0=3.0, main_~a~0=1.0] [L30-L35] COND FALSE !(!(0 != inv_~cond~0)) [L31] inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0)); [L32] inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0); [L33] inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] inv_~xi~0 := inv_~xsi~0; VAL [#NULL!base=0, #NULL!offset=0, inv_#in~A=1.0, inv_~#A_u~0!base=2, inv_~#A_u~0!offset=0, inv_~#xi_u~0!base=4, inv_~#xi_u~0!offset=0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0] [L30-L35] COND TRUE !(0 != inv_~cond~0) [L36] inv_#res := inv_~xi~0; [L23] FCALL call ULTIMATE.dealloc(inv_~#A_u~0); [L36] havoc inv_~#A_u~0; [L23] FCALL call ULTIMATE.dealloc(inv_~#xi_u~0); [L36] havoc inv_~#xi_u~0; [L46] main_#t~ret5 := inv_#res; [L46] main_~r~0 := main_#t~ret5; [L46] havoc main_#t~ret5; [L48] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0); [L48] havoc __VERIFIER_assert_~cond; [L11] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L11] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L11] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet4, main_#t~ret5, main_~a~0, main_~r~0; [L41] havoc main_~a~0; [L41] havoc main_~r~0; [L43] main_~a~0 := main_#t~nondet4; [L43] havoc main_#t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(main_~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(main_~a~0, 30.0) then 1 else 0); [L46] inv_#in~A := main_~a~0; [L46] havoc inv_#res; [L46] havoc inv_#t~mem0, inv_#t~union1, inv_#t~mem2, inv_#t~union3, inv_~A, inv_~xi~0, inv_~xsi~0, inv_~temp~0, inv_~cond~0, inv_~exp~0, inv_~#A_u~0, inv_~#xi_u~0; [L19-L37] inv_~A := inv_#in~A; [L21] havoc inv_~xi~0; [L21] havoc inv_~xsi~0; [L21] havoc inv_~temp~0; [L22] havoc inv_~cond~0; [L22] havoc inv_~exp~0; [L23] FCALL call inv_~#A_u~0 := #Ultimate.alloc(8); [L23] FCALL call inv_~#xi_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(inv_~A, { base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L25] FCALL call inv_#t~mem0 := read~int({ base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L25] inv_~exp~0 := (if ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(inv_#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] FCALL call write~real(inv_#t~union1, { base: inv_~#A_u~0!base, offset: inv_~#A_u~0!offset }, 8); [L25] havoc inv_#t~mem0; [L25] havoc inv_#t~union1; [L26] FCALL call write~real(~convertINTToDOUBLE(1), { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L27] FCALL call write~int(4503599627370496 * (1023 - inv_~exp~0), { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L28] FCALL call inv_#t~mem2 := read~real({ base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L28] inv_~xi~0 := inv_#t~mem2; [L28] FCALL call write~int(inv_#t~union3, { base: inv_~#xi_u~0!base, offset: inv_~#xi_u~0!offset }, 8); [L28] havoc inv_#t~mem2; [L28] havoc inv_#t~union3; [L29] inv_~cond~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, inv_#in~A=1.0, inv_~#A_u~0!base=2, inv_~#A_u~0!offset=0, inv_~#xi_u~0!base=4, inv_~#xi_u~0!offset=0, inv_~A=1.0, inv_~cond~0=1, inv_~exp~0=5260, inv_~xi~0=3.0, main_~a~0=1.0] [L30-L35] COND FALSE !(!(0 != inv_~cond~0)) [L31] inv_~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), inv_~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(inv_~A, inv_~xi~0), inv_~xi~0)); [L32] inv_~temp~0 := ~someBinaryArithmeticDOUBLEoperation(inv_~xsi~0, inv_~xi~0); [L33] inv_~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(inv_~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] inv_~xi~0 := inv_~xsi~0; VAL [#NULL!base=0, #NULL!offset=0, inv_#in~A=1.0, inv_~#A_u~0!base=2, inv_~#A_u~0!offset=0, inv_~#xi_u~0!base=4, inv_~#xi_u~0!offset=0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0] [L30-L35] COND TRUE !(0 != inv_~cond~0) [L36] inv_#res := inv_~xi~0; [L23] FCALL call ULTIMATE.dealloc(inv_~#A_u~0); [L36] havoc inv_~#A_u~0; [L23] FCALL call ULTIMATE.dealloc(inv_~#xi_u~0); [L36] havoc inv_~#xi_u~0; [L46] main_#t~ret5 := inv_#res; [L46] main_~r~0 := main_#t~ret5; [L46] havoc main_#t~ret5; [L48] __VERIFIER_assert_#in~cond := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0, ~convertINTToDOUBLE(0)) && ~someBinaryDOUBLEComparisonOperation(main_~r~0, 0.06) then 1 else 0); [L48] havoc __VERIFIER_assert_~cond; [L11] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L11] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [L11] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, inv_#in~A=1.0, inv_#res=4.0, inv_~A=1.0, inv_~cond~0=0, inv_~exp~0=5260, inv_~xi~0=4.0, inv_~xsi~0=4.0, main_~a~0=1.0, main_~r~0=4.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L41] havoc ~a~0; [L41] havoc ~r~0; [L43] ~a~0 := #t~nondet4; [L43] havoc #t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); [L19-L37] ~A := #in~A; [L21] havoc ~xi~0; [L21] havoc ~xsi~0; [L21] havoc ~temp~0; [L22] havoc ~cond~0; [L22] havoc ~exp~0; [L23] FCALL call ~#A_u~0 := #Ultimate.alloc(8); [L23] FCALL call ~#xi_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~A, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] ~exp~0 := (if ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] FCALL call write~real(#t~union1, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call write~real(~convertINTToDOUBLE(1), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L27] FCALL call write~int(4503599627370496 * (1023 - ~exp~0), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] FCALL call #t~mem2 := read~real({ base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] ~xi~0 := #t~mem2; [L28] FCALL call write~int(#t~union3, { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] havoc #t~mem2; [L28] havoc #t~union3; [L29] ~cond~0 := 1; VAL [#NULL!base=0, #NULL!offset=0] [L30-L35] COND FALSE !(!(0 != ~cond~0)) [L31] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L32] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L33] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] ~xi~0 := ~xsi~0; VAL [#NULL!base=0, #NULL!offset=0] [L30-L35] COND TRUE !(0 != ~cond~0) [L36] #res := ~xi~0; [L23] FCALL call ULTIMATE.dealloc(~#A_u~0); [L36] havoc ~#A_u~0; [L23] FCALL call ULTIMATE.dealloc(~#xi_u~0); [L36] havoc ~#xi_u~0; [L46] ~r~0 := #t~ret5; [L46] havoc #t~ret5; [L11] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L11] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L11] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L41] havoc ~a~0; [L41] havoc ~r~0; [L43] ~a~0 := #t~nondet4; [L43] havoc #t~nondet4; [L44] assume 0 != (if ~someBinaryDOUBLEComparisonOperation(~a~0, 20.0) && ~someBinaryDOUBLEComparisonOperation(~a~0, 30.0) then 1 else 0); [L19-L37] ~A := #in~A; [L21] havoc ~xi~0; [L21] havoc ~xsi~0; [L21] havoc ~temp~0; [L22] havoc ~cond~0; [L22] havoc ~exp~0; [L23] FCALL call ~#A_u~0 := #Ultimate.alloc(8); [L23] FCALL call ~#xi_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~A, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] ~exp~0 := (if ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 <= 2147483647 then ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 else ~bitwiseAnd(#t~mem0, 9218868437227405312) / 4503599627370496 % 4294967296 - 4294967296) - 1023; [L25] FCALL call write~real(#t~union1, { base: ~#A_u~0!base, offset: ~#A_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call write~real(~convertINTToDOUBLE(1), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L27] FCALL call write~int(4503599627370496 * (1023 - ~exp~0), { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] FCALL call #t~mem2 := read~real({ base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] ~xi~0 := #t~mem2; [L28] FCALL call write~int(#t~union3, { base: ~#xi_u~0!base, offset: ~#xi_u~0!offset }, 8); [L28] havoc #t~mem2; [L28] havoc #t~union3; [L29] ~cond~0 := 1; VAL [#NULL!base=0, #NULL!offset=0] [L30-L35] COND FALSE !(!(0 != ~cond~0)) [L31] ~xsi~0 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~convertINTToDOUBLE(2), ~xi~0), ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(~A, ~xi~0), ~xi~0)); [L32] ~temp~0 := ~someBinaryArithmeticDOUBLEoperation(~xsi~0, ~xi~0); [L33] ~cond~0 := (if ~someBinaryDOUBLEComparisonOperation(~temp~0, 1.0E-10) || ~someBinaryDOUBLEComparisonOperation(~temp~0, ~someUnaryDOUBLEoperation(1.0E-10)) then 1 else 0); [L34] ~xi~0 := ~xsi~0; VAL [#NULL!base=0, #NULL!offset=0] [L30-L35] COND TRUE !(0 != ~cond~0) [L36] #res := ~xi~0; [L23] FCALL call ULTIMATE.dealloc(~#A_u~0); [L36] havoc ~#A_u~0; [L23] FCALL call ULTIMATE.dealloc(~#xi_u~0); [L36] havoc ~#xi_u~0; [L46] ~r~0 := #t~ret5; [L46] havoc #t~ret5; [L11] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L11] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L11] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L41] double a,r; [L43] a = __VERIFIER_nondet_double() [L21] double xi, xsi, temp; [L22] signed int cond, exp; [L23] union double_int A_u, xi_u; [L24] A_u.d = A [L25] EXPR A_u.i [L25] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L26] xi_u.d = 1 [L27] xi_u.i = (((long long)(1023-exp)) << 52) [L28] EXPR xi_u.d [L28] xi = xi_u.d [L29] cond = 1 [L30] COND TRUE \read(cond) [L31] xsi = 2*xi-A*xi*xi [L32] temp = xsi-xi [L33] cond = ((temp > 1e-10) || (temp < -1e-10)) [L34] xi = xsi [L30] COND FALSE !(\read(cond)) [L36] return xi; [L36] return xi; [L36] return xi; [L46] r = inv(a) [L11] COND TRUE !(cond) [L11] __VERIFIER_error() ----- [2018-11-23 09:37:58,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 09:37:58 ImpRootNode [2018-11-23 09:37:58,159 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 09:37:58,160 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:37:58,160 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:37:58,160 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:37:58,160 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:37:57" (3/4) ... [2018-11-23 09:37:58,163 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 09:37:58,163 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:37:58,164 INFO L168 Benchmark]: Toolchain (without parser) took 780.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 959.8 MB in the beginning and 1.1 GB in the end (delta: -132.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:58,165 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:37:58,166 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 945.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:58,167 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.66 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:37:58,167 INFO L168 Benchmark]: Boogie Preprocessor took 55.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:58,168 INFO L168 Benchmark]: RCFGBuilder took 217.49 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:58,168 INFO L168 Benchmark]: CodeCheck took 308.74 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: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:37:58,169 INFO L168 Benchmark]: Witness Printer took 3.74 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. [2018-11-23 09:37:58,172 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 12 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 11]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 31, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of to_real at line 26. Possible FailurePath: [L41] double a,r; [L43] a = __VERIFIER_nondet_double() [L21] double xi, xsi, temp; [L22] signed int cond, exp; [L23] union double_int A_u, xi_u; [L24] A_u.d = A [L25] EXPR A_u.i [L25] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L26] xi_u.d = 1 [L27] xi_u.i = (((long long)(1023-exp)) << 52) [L28] EXPR xi_u.d [L28] xi = xi_u.d [L29] cond = 1 [L30] COND TRUE \read(cond) [L31] xsi = 2*xi-A*xi*xi [L32] temp = xsi-xi [L33] cond = ((temp > 1e-10) || (temp < -1e-10)) [L34] xi = xsi [L30] COND FALSE !(\read(cond)) [L36] return xi; [L36] return xi; [L36] return xi; [L46] r = inv(a) [L11] COND TRUE !(cond) [L11] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 945.0 MB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.66 ms. Allocated memory is still 1.0 GB. Free memory is still 945.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 945.0 MB in the beginning and 1.1 GB in the end (delta: -203.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 217.49 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: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * CodeCheck took 308.74 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: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.74 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. 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.23-aa41828 [2018-11-23 09:37:59,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:37:59,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:37:59,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:37:59,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:37:59,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:37:59,588 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:37:59,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:37:59,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:37:59,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:37:59,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:37:59,592 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:37:59,592 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:37:59,593 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:37:59,594 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:37:59,595 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:37:59,596 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:37:59,597 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:37:59,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:37:59,600 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:37:59,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:37:59,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:37:59,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:37:59,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:37:59,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:37:59,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:37:59,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:37:59,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:37:59,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:37:59,607 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:37:59,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:37:59,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:37:59,608 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:37:59,608 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:37:59,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:37:59,609 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:37:59,610 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Bitvector.epf [2018-11-23 09:37:59,621 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:37:59,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:37:59,622 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:37:59,622 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 09:37:59,623 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:37:59,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:37:59,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:37:59,623 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:37:59,623 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:37:59,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:37:59,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:37:59,624 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:37:59,624 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:37:59,624 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:37:59,624 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:37:59,624 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:37:59,624 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:37:59,625 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:37:59,625 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:37:59,625 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 09:37:59,625 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 09:37:59,625 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:37:59,625 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:37:59,625 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 09:37:59,626 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:37:59,626 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:37:59,626 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:37:59,626 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-11-23 09:37:59,626 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 09:37:59,626 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:37:59,626 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:37:59,627 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:37:59,627 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak 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 -> Kojak 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 -> 94c7e44bedb585ab09170efda1a99dc421396ccb [2018-11-23 09:37:59,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:37:59,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:37:59,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:37:59,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:37:59,671 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:37:59,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/../../sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-23 09:37:59,715 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data/a1791134b/a639a9fb0e294032ac6ce0fc276d8d47/FLAGdb4883869 [2018-11-23 09:38:00,042 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:38:00,042 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/sv-benchmarks/c/float-benchs/inv_Newton_true-unreach-call.c [2018-11-23 09:38:00,046 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data/a1791134b/a639a9fb0e294032ac6ce0fc276d8d47/FLAGdb4883869 [2018-11-23 09:38:00,475 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/data/a1791134b/a639a9fb0e294032ac6ce0fc276d8d47 [2018-11-23 09:38:00,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:38:00,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:38:00,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:38:00,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:38:00,482 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:38:00,482 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f841f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00, skipping insertion in model container [2018-11-23 09:38:00,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:38:00,502 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:38:00,625 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:38:00,629 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:38:00,648 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:38:00,669 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:38:00,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00 WrapperNode [2018-11-23 09:38:00,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:38:00,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:38:00,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:38:00,670 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:38:00,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:38:00,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:38:00,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:38:00,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:38:00,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... [2018-11-23 09:38:00,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:38:00,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:38:00,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:38:00,727 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:38:00,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:38:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 09:38:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 09:38:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 09:38:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2018-11-23 09:38:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:38:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:38:00,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:38:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2018-11-23 09:38:00,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:38:00,934 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 09:38:02,304 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:38:02,304 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 09:38:02,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:38:02 BoogieIcfgContainer [2018-11-23 09:38:02,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:38:02,305 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 09:38:02,306 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 09:38:02,314 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 09:38:02,314 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:38:02" (1/1) ... [2018-11-23 09:38:02,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:38:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:38:02,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-23 09:38:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-23 09:38:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 09:38:02,355 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:38:02,387 ERROR L613 CodeCheckObserver]: First Tracecheck threw exception Indexed Sort BitVec undefined [2018-11-23 09:38:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:38:02,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:38:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:38:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:38:02,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 1 states and 0 transitions. [2018-11-23 09:38:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1 states and 0 transitions. [2018-11-23 09:38:02,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:38:02,430 WARN L424 CodeCheckObserver]: This Program is SAFE, Check terminated with 2 iterations. [2018-11-23 09:38:02,437 INFO L775 CodeCheckObserver]: All specifications hold 1 specifications checked. All of them hold [2018-11-23 09:38:02,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 09:38:02 ImpRootNode [2018-11-23 09:38:02,443 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 09:38:02,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:38:02,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:38:02,444 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:38:02,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:38:02" (3/4) ... [2018-11-23 09:38:02,446 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 09:38:02,452 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-23 09:38:02,452 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 09:38:02,452 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 09:38:02,480 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_75d47728-f537-45cf-b4d6-0a7c74ec1419/bin-2019/ukojak/witness.graphml [2018-11-23 09:38:02,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:38:02,481 INFO L168 Benchmark]: Toolchain (without parser) took 2002.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -123.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:38:02,482 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:38:02,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.80 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 09:38:02,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.72 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:38:02,483 INFO L168 Benchmark]: Boogie Preprocessor took 25.49 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:38:02,484 INFO L168 Benchmark]: RCFGBuilder took 1578.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:38:02,484 INFO L168 Benchmark]: CodeCheck took 137.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:38:02,484 INFO L168 Benchmark]: Witness Printer took 36.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:38:02,486 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 12 locations, 1 error locations. SAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 11 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - PositiveResult [Line: 11]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.80 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.72 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.49 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1578.40 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * CodeCheck took 137.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Witness Printer took 36.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be correct! Received shutdown request...