./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1071_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_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 922786d1b563f399f230d6bc6e72c1342da4d1a5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 922786d1b563f399f230d6bc6e72c1342da4d1a5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:34:32,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:34:32,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:34:32,104 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:34:32,105 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:34:32,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:34:32,106 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:34:32,107 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:34:32,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:34:32,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:34:32,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:34:32,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:34:32,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:34:32,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:34:32,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:34:32,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:34:32,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:34:32,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:34:32,116 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:34:32,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:34:32,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:34:32,120 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:34:32,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:34:32,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:34:32,122 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:34:32,123 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:34:32,124 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:34:32,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:34:32,125 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:34:32,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:34:32,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:34:32,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:34:32,127 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:34:32,127 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:34:32,128 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:34:32,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:34:32,128 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 01:34:32,137 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:34:32,137 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:34:32,138 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:34:32,138 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:34:32,138 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:34:32,138 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:34:32,138 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:34:32,138 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 01:34:32,138 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:34:32,139 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:34:32,139 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 01:34:32,139 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 01:34:32,139 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:34:32,139 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:34:32,139 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:34:32,139 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:34:32,140 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:34:32,140 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:34:32,140 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:34:32,140 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:34:32,140 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:34:32,140 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:34:32,140 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:34:32,140 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:34:32,140 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:34:32,140 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:34:32,141 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:34:32,141 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:34:32,141 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:34:32,141 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:34:32,141 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:34:32,141 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:34:32,142 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:34:32,142 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 01:34:32,142 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:34:32,142 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:34:32,142 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 01:34:32,142 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 922786d1b563f399f230d6bc6e72c1342da4d1a5 [2018-11-23 01:34:32,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:34:32,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:34:32,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:34:32,187 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:34:32,188 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:34:32,188 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c [2018-11-23 01:34:32,232 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data/c9223d914/e1fa8fec889a4043895a7f62df99bd1e/FLAGaccbf7374 [2018-11-23 01:34:32,585 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:34:32,585 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c [2018-11-23 01:34:32,591 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data/c9223d914/e1fa8fec889a4043895a7f62df99bd1e/FLAGaccbf7374 [2018-11-23 01:34:32,601 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data/c9223d914/e1fa8fec889a4043895a7f62df99bd1e [2018-11-23 01:34:32,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:34:32,605 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:34:32,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:34:32,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:34:32,608 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:34:32,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed7bee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32, skipping insertion in model container [2018-11-23 01:34:32,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,619 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:34:32,638 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:34:32,781 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:34:32,784 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:34:32,803 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:34:32,818 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:34:32,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32 WrapperNode [2018-11-23 01:34:32,819 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:34:32,819 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:34:32,819 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:34:32,820 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:34:32,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,839 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:34:32,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:34:32,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:34:32,888 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:34:32,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,915 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... [2018-11-23 01:34:32,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:34:32,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:34:32,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:34:32,917 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:34:32,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:34:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 01:34:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 01:34:32,963 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 01:34:32,963 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 01:34:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:34:32,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:34:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 01:34:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:34:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:34:32,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:34:32,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 01:34:32,965 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:34:32,965 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:34:32,965 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_double [2018-11-23 01:34:32,965 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_double [2018-11-23 01:34:32,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:34:33,234 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:34:33,235 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 01:34:33,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:34:33 BoogieIcfgContainer [2018-11-23 01:34:33,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:34:33,236 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:34:33,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:34:33,239 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:34:33,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:34:32" (1/3) ... [2018-11-23 01:34:33,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa41211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:34:33, skipping insertion in model container [2018-11-23 01:34:33,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:32" (2/3) ... [2018-11-23 01:34:33,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa41211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:34:33, skipping insertion in model container [2018-11-23 01:34:33,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:34:33" (3/3) ... [2018-11-23 01:34:33,243 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1071_true-unreach-call.c [2018-11-23 01:34:33,254 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:34:33,262 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:34:33,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:34:33,314 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:34:33,314 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:34:33,314 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:34:33,315 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:34:33,315 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:34:33,315 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:34:33,315 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:34:33,315 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:34:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 01:34:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 01:34:33,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:33,340 INFO L402 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] [2018-11-23 01:34:33,342 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:33,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:33,347 INFO L82 PathProgramCache]: Analyzing trace with hash -452059413, now seen corresponding path program 1 times [2018-11-23 01:34:33,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:34:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:33,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:33,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:33,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:34:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:33,469 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 01:34:33,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:33,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:34:33,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 01:34:33,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 01:34:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:34:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:34:33,486 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2018-11-23 01:34:33,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:33,503 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2018-11-23 01:34:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:34:33,505 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 01:34:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:33,514 INFO L225 Difference]: With dead ends: 66 [2018-11-23 01:34:33,514 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 01:34:33,517 INFO L631 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 [2018-11-23 01:34:33,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 01:34:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 01:34:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 01:34:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 01:34:33,546 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 23 [2018-11-23 01:34:33,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:33,546 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 01:34:33,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 01:34:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 01:34:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 01:34:33,548 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:33,548 INFO L402 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] [2018-11-23 01:34:33,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:33,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:33,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1570049965, now seen corresponding path program 1 times [2018-11-23 01:34:33,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 01:34:33,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:33,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:33,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 01:34:33,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 01:34:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:34:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:34:33,638 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=16, |#NULL.offset|=12, |old(#NULL.base)|=16, |old(#NULL.offset)|=12] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=12] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=16, |old(#NULL.offset)|=12] [?] RET #91#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10 := trunc_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=9.0] [?] ~x := #in~x;havoc ~signbit~0;havoc ~msw~0;havoc ~lsw~0;havoc ~exponent_less_1023~0; VAL [trunc_double_~x=9.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=9.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [trunc_double_~lsw~0=17, trunc_double_~msw~0=3, trunc_double_~x=9.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=9.0] [?] goto; VAL [trunc_double_~lsw~0=17, trunc_double_~msw~0=3, trunc_double_~x=9.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=9.0] [?] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296);~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=17, trunc_double_~msw~0=3, trunc_double_~signbit~0=(- 1), trunc_double_~x=9.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=9.0] [?] assume !(~exponent_less_1023~0 < 20); VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=17, trunc_double_~msw~0=3, trunc_double_~signbit~0=(- 1), trunc_double_~x=9.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=9.0] [?] assume ~exponent_less_1023~0 > 51; VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=17, trunc_double_~msw~0=3, trunc_double_~signbit~0=(- 1), trunc_double_~x=9.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=9.0] [?] assume 1024 == ~exponent_less_1023~0;#res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=17, trunc_double_~msw~0=3, trunc_double_~signbit~0=(- 1), trunc_double_~x=9.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=9.0] [?] assume true; VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=17, trunc_double_~msw~0=3, trunc_double_~signbit~0=(- 1), trunc_double_~x=9.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=9.0] [?] RET #95#return; VAL [main_~x~0=9.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=15.0] [?] ~res~0 := #t~ret10;havoc #t~ret10; VAL [main_~res~0=15.0, main_~x~0=9.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := isnan_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=15.0] [?] ~x := #in~x;#res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_double_~x=15.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=15.0, |isnan_double_#res|=0] [?] assume true; VAL [isnan_double_~x=15.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_double_#in~x|=15.0, |isnan_double_#res|=0] [?] RET #97#return; VAL [main_~res~0=15.0, main_~x~0=9.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~res~0=15.0, main_~x~0=9.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0] [?] assume 0 == #t~ret11;havoc #t~ret11; VAL [main_~res~0=15.0, main_~x~0=9.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=15.0, main_~x~0=9.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=12, old(#NULL.base)=16, old(#NULL.offset)=12] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=12] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=12] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L70] CALL call #t~ret10 := trunc_double(~x~0); VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~x=9.0] [L23] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L26] ~lsw~0 := #t~mem2; [L26] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L23] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=17, ~msw~0=3, ~x=9.0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L30-L58] assume !(~exponent_less_1023~0 < 20); VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L47-L58] assume ~exponent_less_1023~0 > 51; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L48-L50] assume 1024 == ~exponent_less_1023~0; [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L17-L60] ensures true; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L70] RET call #t~ret10 := trunc_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=15.0, ~x~0=9.0] [L70] ~res~0 := #t~ret10; [L70] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=15.0, ~x~0=9.0] [L73] CALL call #t~ret11 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, #res=0, ~x=15.0] [L15] ensures true; VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, #res=0, ~x=15.0] [L73] RET call #t~ret11 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73-L76] assume 0 == #t~ret11; [L73] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=15.0, ~x~0=9.0] [L74] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=15.0, ~x~0=9.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=16, #NULL.offset=12, old(#NULL.base)=16, old(#NULL.offset)=12] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=12] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=16, old(#NULL.offset)=12] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0] [L70] CALL call #t~ret10 := trunc_double(~x~0); VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~x=9.0] [L23] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L26] ~lsw~0 := #t~mem2; [L26] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L23] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=17, ~msw~0=3, ~x=9.0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L30-L58] assume !(~exponent_less_1023~0 < 20); VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L47-L58] assume ~exponent_less_1023~0 > 51; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L48-L50] assume 1024 == ~exponent_less_1023~0; [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L17-L60] ensures true; VAL [#in~x=9.0, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L70] RET call #t~ret10 := trunc_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=15.0, ~x~0=9.0] [L70] ~res~0 := #t~ret10; [L70] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=15.0, ~x~0=9.0] [L73] CALL call #t~ret11 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, #res=0, ~x=15.0] [L15] ensures true; VAL [#in~x=15.0, #NULL.base=0, #NULL.offset=0, #res=0, ~x=15.0] [L73] RET call #t~ret11 := isnan_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73-L76] assume 0 == #t~ret11; [L73] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=15.0, ~x~0=9.0] [L74] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=15.0, ~x~0=9.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=12, old(#NULL!base)=16, old(#NULL!offset)=12] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=12] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L70] CALL call #t~ret10 := trunc_double(~x~0); VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~x=9.0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=17, ~msw~0=3, ~x=9.0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L70] RET call #t~ret10 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=15.0, ~x~0=9.0] [L70] ~res~0 := #t~ret10; [L70] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [L73] CALL call #t~ret11 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, #res=0, ~x=15.0] [L73] RET call #t~ret11 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] COND TRUE 0 == #t~ret11 [L73] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=12, old(#NULL!base)=16, old(#NULL!offset)=12] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=12] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L70] CALL call #t~ret10 := trunc_double(~x~0); VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~x=9.0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=17, ~msw~0=3, ~x=9.0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L70] RET call #t~ret10 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=15.0, ~x~0=9.0] [L70] ~res~0 := #t~ret10; [L70] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [L73] CALL call #t~ret11 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, #res=0, ~x=15.0] [L73] RET call #t~ret11 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] COND TRUE 0 == #t~ret11 [L73] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=12, old(#NULL!base)=16, old(#NULL!offset)=12] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=12] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L70] CALL call #t~ret10 := trunc_double(~x~0); VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~x=9.0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=17, ~msw~0=3, ~x=9.0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L70] RET call #t~ret10 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=15.0, ~x~0=9.0] [L70] ~res~0 := #t~ret10; [L70] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [L73] CALL call #t~ret11 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, #res=0, ~x=15.0] [L73] RET call #t~ret11 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] COND TRUE 0 == #t~ret11 [L73] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=16, #NULL!offset=12, old(#NULL!base)=16, old(#NULL!offset)=12] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=16, old(#NULL!offset)=12] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L68] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0] [L70] CALL call #t~ret10 := trunc_double(~x~0); VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~x=9.0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem0; [L25] havoc #t~union1; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~mem2; [L26] havoc #t~union3; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=17, ~msw~0=3, ~x=9.0] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=9.0, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=17, ~msw~0=3, ~signbit~0=-1, ~x=9.0] [L70] RET call #t~ret10 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=15.0, ~x~0=9.0] [L70] ~res~0 := #t~ret10; [L70] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [L73] CALL call #t~ret11 := isnan_double(~res~0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0] [L15] ~x := #in~x; [L15] #res := (if ~someBinaryDOUBLEComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=15.0, #NULL!base=0, #NULL!offset=0, #res=0, ~x=15.0] [L73] RET call #t~ret11 := isnan_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~res~0=15.0, ~x~0=9.0] [L73] COND TRUE 0 == #t~ret11 [L73] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=15.0, ~x~0=9.0] [L68] double x = 0.0 / 0.0; [L70] CALL, EXPR trunc_double(x) VAL [\old(x)=9] [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; VAL [\old(x)=9, x=9] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=9, exponent_less_1023=1024, lsw=17, msw=3, signbit=-1, x=9] [L30] COND FALSE !(exponent_less_1023 < 20) VAL [\old(x)=9, exponent_less_1023=1024, lsw=17, msw=3, signbit=-1, x=9] [L47] COND TRUE exponent_less_1023 > 51 VAL [\old(x)=9, exponent_less_1023=1024, lsw=17, msw=3, signbit=-1, x=9] [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; VAL [\old(x)=9, exponent_less_1023=1024, lsw=17, msw=3, signbit=-1, x=9] [L70] RET, EXPR trunc_double(x) VAL [trunc_double(x)=15, x=9] [L70] double res = trunc_double(x); [L73] CALL, EXPR isnan_double(res) VAL [\old(x)=15] [L15] return x != x; VAL [\old(x)=15, \result=0, x=15] [L73] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=15, x=9] [L73] COND TRUE !isnan_double(res) [L74] __VERIFIER_error() VAL [res=15, x=9] ----- [2018-11-23 01:34:33,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:34:33 BoogieIcfgContainer [2018-11-23 01:34:33,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:34:33,675 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:34:33,675 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:34:33,675 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:34:33,676 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:34:33" (3/4) ... [2018-11-23 01:34:33,679 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 01:34:33,679 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:34:33,680 INFO L168 Benchmark]: Toolchain (without parser) took 1075.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -110.9 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:33,681 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:34:33,682 INFO L168 Benchmark]: CACSL2BoogieTranslator took 213.72 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:33,682 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:33,683 INFO L168 Benchmark]: Boogie Preprocessor took 28.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:33,684 INFO L168 Benchmark]: RCFGBuilder took 318.41 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:33,684 INFO L168 Benchmark]: TraceAbstraction took 439.02 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:33,685 INFO L168 Benchmark]: Witness Printer took 3.88 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 01:34:33,688 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 213.72 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -189.7 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.42 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 318.41 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 439.02 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: 40.3 MB). Peak memory consumption was 40.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 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: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 15, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of bitwiseAnd at line 28. Possible FailurePath: [L68] double x = 0.0 / 0.0; [L70] CALL, EXPR trunc_double(x) VAL [\old(x)=9] [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; VAL [\old(x)=9, x=9] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=9, exponent_less_1023=1024, lsw=17, msw=3, signbit=-1, x=9] [L30] COND FALSE !(exponent_less_1023 < 20) VAL [\old(x)=9, exponent_less_1023=1024, lsw=17, msw=3, signbit=-1, x=9] [L47] COND TRUE exponent_less_1023 > 51 VAL [\old(x)=9, exponent_less_1023=1024, lsw=17, msw=3, signbit=-1, x=9] [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; VAL [\old(x)=9, exponent_less_1023=1024, lsw=17, msw=3, signbit=-1, x=9] [L70] RET, EXPR trunc_double(x) VAL [trunc_double(x)=15, x=9] [L70] double res = trunc_double(x); [L73] CALL, EXPR isnan_double(res) VAL [\old(x)=15] [L15] return x != x; VAL [\old(x)=15, \result=0, x=15] [L73] RET, EXPR isnan_double(res) VAL [isnan_double(res)=0, res=15, x=9] [L73] COND TRUE !isnan_double(res) [L74] __VERIFIER_error() VAL [res=15, x=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 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=37occurred in iteration=0, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-aa41828 [2018-11-23 01:34:35,446 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:34:35,448 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:34:35,458 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:34:35,458 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:34:35,459 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:34:35,460 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:34:35,462 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:34:35,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:34:35,464 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:34:35,465 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:34:35,465 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:34:35,466 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:34:35,467 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:34:35,468 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:34:35,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:34:35,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:34:35,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:34:35,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:34:35,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:34:35,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:34:35,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:34:35,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:34:35,477 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:34:35,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:34:35,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:34:35,479 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:34:35,480 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:34:35,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:34:35,481 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:34:35,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:34:35,482 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:34:35,482 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:34:35,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:34:35,483 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:34:35,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:34:35,484 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 01:34:35,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:34:35,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:34:35,498 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:34:35,498 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 01:34:35,498 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 01:34:35,499 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 01:34:35,499 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 01:34:35,499 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 01:34:35,499 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 01:34:35,499 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 01:34:35,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:34:35,500 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 01:34:35,500 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 01:34:35,500 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:34:35,500 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:34:35,501 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:34:35,501 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:34:35,501 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 01:34:35,501 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 01:34:35,501 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 01:34:35,501 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:34:35,502 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:34:35,502 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:34:35,502 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:34:35,502 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 01:34:35,502 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:34:35,503 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 01:34:35,503 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:34:35,503 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:34:35,503 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:34:35,503 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:34:35,503 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 01:34:35,503 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:34:35,504 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 01:34:35,504 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 01:34:35,504 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_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 922786d1b563f399f230d6bc6e72c1342da4d1a5 [2018-11-23 01:34:35,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:34:35,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:34:35,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:34:35,555 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:34:35,555 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:34:35,556 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c [2018-11-23 01:34:35,610 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data/46a0a3a07/dc779b36cc8f415892ad8dccc9dbe9da/FLAGa593ac0ef [2018-11-23 01:34:35,960 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:34:35,961 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/sv-benchmarks/c/float-newlib/double_req_bl_1071_true-unreach-call.c [2018-11-23 01:34:35,967 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data/46a0a3a07/dc779b36cc8f415892ad8dccc9dbe9da/FLAGa593ac0ef [2018-11-23 01:34:36,381 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/data/46a0a3a07/dc779b36cc8f415892ad8dccc9dbe9da [2018-11-23 01:34:36,383 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:34:36,384 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:34:36,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:34:36,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:34:36,388 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:34:36,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,391 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a554a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36, skipping insertion in model container [2018-11-23 01:34:36,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:34:36,419 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:34:36,589 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:34:36,594 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:34:36,619 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:34:36,641 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:34:36,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36 WrapperNode [2018-11-23 01:34:36,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:34:36,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:34:36,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:34:36,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:34:36,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:34:36,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:34:36,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:34:36,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:34:36,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... [2018-11-23 01:34:36,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:34:36,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:34:36,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:34:36,698 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:34:36,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 01:34:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_double [2018-11-23 01:34:36,791 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_double [2018-11-23 01:34:36,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 01:34:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 01:34:36,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 01:34:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 01:34:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 01:34:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 01:34:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:34:36,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:34:36,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 01:34:36,793 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 01:34:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_double [2018-11-23 01:34:36,793 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_double [2018-11-23 01:34:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 01:34:36,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 01:34:37,073 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 01:34:37,123 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:34:37,123 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 01:34:37,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:34:37 BoogieIcfgContainer [2018-11-23 01:34:37,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:34:37,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 01:34:37,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 01:34:37,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 01:34:37,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:34:36" (1/3) ... [2018-11-23 01:34:37,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0c4dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:34:37, skipping insertion in model container [2018-11-23 01:34:37,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:34:36" (2/3) ... [2018-11-23 01:34:37,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a0c4dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:34:37, skipping insertion in model container [2018-11-23 01:34:37,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:34:37" (3/3) ... [2018-11-23 01:34:37,129 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1071_true-unreach-call.c [2018-11-23 01:34:37,138 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 01:34:37,143 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 01:34:37,158 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 01:34:37,182 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 01:34:37,182 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 01:34:37,182 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 01:34:37,182 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 01:34:37,183 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 01:34:37,183 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 01:34:37,183 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 01:34:37,183 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 01:34:37,183 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 01:34:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-23 01:34:37,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 01:34:37,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:37,200 INFO L402 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] [2018-11-23 01:34:37,202 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:37,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:37,206 INFO L82 PathProgramCache]: Analyzing trace with hash -667271772, now seen corresponding path program 1 times [2018-11-23 01:34:37,209 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:34:37,209 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 01:34:37,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:37,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:37,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:34:37,323 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 01:34:37,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:34:37,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:37,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 01:34:37,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 01:34:37,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 01:34:37,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:34:37,348 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-23 01:34:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:37,365 INFO L93 Difference]: Finished difference Result 64 states and 88 transitions. [2018-11-23 01:34:37,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 01:34:37,366 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 01:34:37,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:37,375 INFO L225 Difference]: With dead ends: 64 [2018-11-23 01:34:37,375 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 01:34:37,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 01:34:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 01:34:37,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 01:34:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 01:34:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-11-23 01:34:37,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 22 [2018-11-23 01:34:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:37,412 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2018-11-23 01:34:37,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 01:34:37,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 01:34:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 01:34:37,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:37,413 INFO L402 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] [2018-11-23 01:34:37,413 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:37,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:37,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1969483353, now seen corresponding path program 1 times [2018-11-23 01:34:37,414 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:34:37,414 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 01:34:37,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:37,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:37,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:34:38,876 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 01:34:38,877 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:34:38,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:38,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:34:38,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:34:38,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:34:38,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:34:38,889 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 9 states. [2018-11-23 01:34:40,283 WARN L180 SmtUtils]: Spent 604.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 01:34:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:41,254 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 01:34:41,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:34:41,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-11-23 01:34:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:41,257 INFO L225 Difference]: With dead ends: 42 [2018-11-23 01:34:41,258 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 01:34:41,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:34:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 01:34:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-11-23 01:34:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 01:34:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 01:34:41,268 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2018-11-23 01:34:41,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:41,268 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 01:34:41,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:34:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 01:34:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 01:34:41,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:41,270 INFO L402 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] [2018-11-23 01:34:41,270 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:41,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:41,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1200957863, now seen corresponding path program 1 times [2018-11-23 01:34:41,271 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:34:41,271 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 01:34:41,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:41,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:34:41,494 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 01:34:41,494 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:34:41,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:41,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 01:34:41,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 01:34:41,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 01:34:41,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 01:34:41,511 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2018-11-23 01:34:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:41,888 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 01:34:41,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 01:34:41,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-11-23 01:34:41,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:41,890 INFO L225 Difference]: With dead ends: 40 [2018-11-23 01:34:41,890 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 01:34:41,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 01:34:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 01:34:41,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 01:34:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 01:34:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 01:34:41,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 24 [2018-11-23 01:34:41,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:41,896 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 01:34:41,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 01:34:41,896 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 01:34:41,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 01:34:41,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:41,897 INFO L402 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] [2018-11-23 01:34:41,897 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:41,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:41,897 INFO L82 PathProgramCache]: Analyzing trace with hash 505464083, now seen corresponding path program 1 times [2018-11-23 01:34:41,898 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:34:41,898 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/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 [2018-11-23 01:34:41,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:41,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:34:42,125 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 01:34:42,126 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:34:42,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:42,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 01:34:42,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 01:34:42,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 01:34:42,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-23 01:34:42,142 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 8 states. [2018-11-23 01:34:42,555 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-23 01:34:42,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:42,878 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-23 01:34:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 01:34:42,880 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 01:34:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:42,880 INFO L225 Difference]: With dead ends: 42 [2018-11-23 01:34:42,880 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 01:34:42,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-23 01:34:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 01:34:42,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 01:34:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 01:34:42,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 01:34:42,886 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-11-23 01:34:42,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:42,887 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 01:34:42,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 01:34:42,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 01:34:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 01:34:42,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 01:34:42,888 INFO L402 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] [2018-11-23 01:34:42,888 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 01:34:42,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:34:42,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1157487195, now seen corresponding path program 1 times [2018-11-23 01:34:42,888 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 01:34:42,888 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/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 [2018-11-23 01:34:42,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 01:34:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:34:42,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 01:34:43,063 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 01:34:43,063 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 01:34:43,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 01:34:43,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 01:34:43,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 01:34:43,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 01:34:43,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 01:34:43,074 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 7 states. [2018-11-23 01:34:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 01:34:43,430 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 01:34:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 01:34:43,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 01:34:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 01:34:43,431 INFO L225 Difference]: With dead ends: 28 [2018-11-23 01:34:43,431 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 01:34:43,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 01:34:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 01:34:43,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 01:34:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 01:34:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 01:34:43,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-11-23 01:34:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 01:34:43,433 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 01:34:43,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 01:34:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 01:34:43,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 01:34:43,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 01:34:43,734 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-11-23 01:34:43,854 INFO L451 ceAbstractionStarter]: At program point isnan_doubleENTRY(line 15) the Hoare annotation is: true [2018-11-23 01:34:43,854 INFO L448 ceAbstractionStarter]: For program point isnan_doubleEXIT(line 15) no Hoare annotation was computed. [2018-11-23 01:34:43,854 INFO L448 ceAbstractionStarter]: For program point isnan_doubleFINAL(line 15) no Hoare annotation was computed. [2018-11-23 01:34:43,854 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:34:43,855 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:34:43,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:34:43,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 01:34:43,855 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 01:34:43,855 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 01:34:43,855 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 01:34:43,855 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 62 79) the Hoare annotation is: true [2018-11-23 01:34:43,855 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 62 79) no Hoare annotation was computed. [2018-11-23 01:34:43,855 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-23 01:34:43,855 INFO L444 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= main_~x~0 .cse0) (= main_~res~0 .cse0))) [2018-11-23 01:34:43,856 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 62 79) no Hoare annotation was computed. [2018-11-23 01:34:43,856 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 73 76) no Hoare annotation was computed. [2018-11-23 01:34:43,856 INFO L444 ceAbstractionStarter]: At program point L70(line 70) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) [2018-11-23 01:34:43,856 INFO L448 ceAbstractionStarter]: For program point L70-1(line 70) no Hoare annotation was computed. [2018-11-23 01:34:43,856 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2018-11-23 01:34:43,856 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 46) no Hoare annotation was computed. [2018-11-23 01:34:43,856 INFO L448 ceAbstractionStarter]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2018-11-23 01:34:43,856 INFO L444 ceAbstractionStarter]: At program point L52-2(lines 52 57) the Hoare annotation is: (and (exists ((v_prenex_5 (_ BitVec 64))) (let ((.cse0 (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_5)) (_ bv20 32)) (_ bv4294966273 32)))) (and (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |trunc_double_#in~x|) (not (bvslt .cse0 (_ bv20 32))) (not (bvsgt .cse0 (_ bv51 32)))))) (exists ((v_prenex_5 (_ BitVec 64))) (and (= ((_ extract 63 32) v_prenex_5) trunc_double_~msw~0) (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |trunc_double_#in~x|))) (exists ((v_prenex_5 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |trunc_double_#in~x|) (= (bvadd trunc_double_~exponent_less_1023~0 (_ bv1023 32)) (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_5)) (_ bv20 32))))) (= trunc_double_~x |trunc_double_#in~x|)) [2018-11-23 01:34:43,857 INFO L448 ceAbstractionStarter]: For program point L52-3(lines 30 58) no Hoare annotation was computed. [2018-11-23 01:34:43,857 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 50) no Hoare annotation was computed. [2018-11-23 01:34:43,857 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2018-11-23 01:34:43,857 INFO L444 ceAbstractionStarter]: At program point L32-2(lines 32 37) the Hoare annotation is: (and (exists ((v_prenex_6 (_ BitVec 64))) (and (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_6)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32)) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) |trunc_double_#in~x|))) (exists ((v_prenex_5 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |trunc_double_#in~x|) (= (bvadd trunc_double_~exponent_less_1023~0 (_ bv1023 32)) (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_5)) (_ bv20 32))))) (= trunc_double_~x |trunc_double_#in~x|) (exists ((v_prenex_6 (_ BitVec 64))) (and (= trunc_double_~msw~0 ((_ extract 63 32) v_prenex_6)) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) |trunc_double_#in~x|)))) [2018-11-23 01:34:43,857 INFO L451 ceAbstractionStarter]: At program point trunc_doubleENTRY(lines 17 60) the Hoare annotation is: true [2018-11-23 01:34:43,857 INFO L448 ceAbstractionStarter]: For program point trunc_doubleEXIT(lines 17 60) no Hoare annotation was computed. [2018-11-23 01:34:43,858 INFO L448 ceAbstractionStarter]: For program point trunc_doubleFINAL(lines 17 60) no Hoare annotation was computed. [2018-11-23 01:34:43,858 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 58) no Hoare annotation was computed. [2018-11-23 01:34:43,858 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2018-11-23 01:34:43,858 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 27) the Hoare annotation is: (= trunc_double_~x |trunc_double_#in~x|) [2018-11-23 01:34:43,858 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2018-11-23 01:34:43,858 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2018-11-23 01:34:43,858 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 39 45) no Hoare annotation was computed. [2018-11-23 01:34:43,859 INFO L444 ceAbstractionStarter]: At program point L39-2(lines 39 45) the Hoare annotation is: (and (exists ((v_prenex_6 (_ BitVec 64))) (and (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_6)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32)) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) |trunc_double_#in~x|))) (exists ((v_prenex_5 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_5) ((_ extract 62 52) v_prenex_5) ((_ extract 51 0) v_prenex_5)) |trunc_double_#in~x|) (= (bvadd trunc_double_~exponent_less_1023~0 (_ bv1023 32)) (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_5)) (_ bv20 32))))) (= trunc_double_~x |trunc_double_#in~x|) (exists ((v_prenex_6 (_ BitVec 64))) (and (= trunc_double_~msw~0 ((_ extract 63 32) v_prenex_6)) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) |trunc_double_#in~x|)))) [2018-11-23 01:34:43,865 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,866 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,867 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,868 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,868 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,868 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,868 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,869 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,870 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,877 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,877 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,878 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,879 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,880 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,882 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,883 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,884 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,885 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,886 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,887 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,888 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,889 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,890 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,891 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,892 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,893 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,894 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,895 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:34:43 BoogieIcfgContainer [2018-11-23 01:34:43,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 01:34:43,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:34:43,898 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:34:43,898 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:34:43,899 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:34:37" (3/4) ... [2018-11-23 01:34:43,903 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 01:34:43,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_double [2018-11-23 01:34:43,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 01:34:43,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 01:34:43,910 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure trunc_double [2018-11-23 01:34:43,914 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-23 01:34:43,914 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-23 01:34:43,914 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 01:34:43,935 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 01:34:43,936 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_6 : bv64 :: ~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_6[63:32]), 20bv32), 4294966273bv32), 20bv32) && ~fp~LONGDOUBLE(v_prenex_6[63:63], v_prenex_6[62:52], v_prenex_6[51:0]) == \old(x)) && (\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && ~bvadd64(exponent_less_1023, 1023bv32) == ~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32))) && x == \old(x)) && (\exists v_prenex_6 : bv64 :: msw == v_prenex_6[63:32] && ~fp~LONGDOUBLE(v_prenex_6[63:63], v_prenex_6[62:52], v_prenex_6[51:0]) == \old(x)) [2018-11-23 01:34:43,936 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_6 : bv64 :: ~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_6[63:32]), 20bv32), 4294966273bv32), 20bv32) && ~fp~LONGDOUBLE(v_prenex_6[63:63], v_prenex_6[62:52], v_prenex_6[51:0]) == \old(x)) && (\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && ~bvadd64(exponent_less_1023, 1023bv32) == ~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32))) && x == \old(x)) && (\exists v_prenex_6 : bv64 :: msw == v_prenex_6[63:32] && ~fp~LONGDOUBLE(v_prenex_6[63:63], v_prenex_6[62:52], v_prenex_6[51:0]) == \old(x)) [2018-11-23 01:34:43,936 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_5 : bv64 :: (~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32), 4294966273bv32), 20bv32)) && !~bvsgt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32), 4294966273bv32), 51bv32)) && (\exists v_prenex_5 : bv64 :: v_prenex_5[63:32] == msw && ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x))) && (\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && ~bvadd64(exponent_less_1023, 1023bv32) == ~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32))) && x == \old(x) [2018-11-23 01:34:43,957 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_aa63461c-e15f-4bea-ba64-3d4b94f14520/bin-2019/utaipan/witness.graphml [2018-11-23 01:34:43,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:34:43,958 INFO L168 Benchmark]: Toolchain (without parser) took 7574.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 949.7 MB in the beginning and 894.6 MB in the end (delta: 55.2 MB). Peak memory consumption was 197.3 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:43,959 INFO L168 Benchmark]: CDTParser took 0.18 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 01:34:43,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.25 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 01:34:43,960 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.65 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 01:34:43,960 INFO L168 Benchmark]: Boogie Preprocessor took 30.78 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 01:34:43,960 INFO L168 Benchmark]: RCFGBuilder took 425.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:43,960 INFO L168 Benchmark]: TraceAbstraction took 6773.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 894.6 MB in the end (delta: 211.0 MB). Peak memory consumption was 211.0 MB. Max. memory is 11.5 GB. [2018-11-23 01:34:43,961 INFO L168 Benchmark]: Witness Printer took 59.16 ms. Allocated memory is still 1.2 GB. Free memory is still 894.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:34:43,963 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 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 257.25 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 23.65 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 30.78 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 425.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6773.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 894.6 MB in the end (delta: 211.0 MB). Peak memory consumption was 211.0 MB. Max. memory is 11.5 GB. * Witness Printer took 59.16 ms. Allocated memory is still 1.2 GB. Free memory is still 894.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 52]: Loop Invariant [2018-11-23 01:34:43,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_5 : bv64 :: (~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && !~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32), 4294966273bv32), 20bv32)) && !~bvsgt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32), 4294966273bv32), 51bv32)) && (\exists v_prenex_5 : bv64 :: v_prenex_5[63:32] == msw && ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x))) && (\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && ~bvadd64(exponent_less_1023, 1023bv32) == ~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32))) && x == \old(x) - InvariantResult [Line: 32]: Loop Invariant [2018-11-23 01:34:43,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_6 : bv64 :: ~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_6[63:32]), 20bv32), 4294966273bv32), 20bv32) && ~fp~LONGDOUBLE(v_prenex_6[63:63], v_prenex_6[62:52], v_prenex_6[51:0]) == \old(x)) && (\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && ~bvadd64(exponent_less_1023, 1023bv32) == ~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32))) && x == \old(x)) && (\exists v_prenex_6 : bv64 :: msw == v_prenex_6[63:32] && ~fp~LONGDOUBLE(v_prenex_6[63:63], v_prenex_6[62:52], v_prenex_6[51:0]) == \old(x)) - InvariantResult [Line: 39]: Loop Invariant [2018-11-23 01:34:43,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,982 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,983 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_5,QUANTIFIED] [2018-11-23 01:34:43,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] [2018-11-23 01:34:43,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_6,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_6 : bv64 :: ~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_6[63:32]), 20bv32), 4294966273bv32), 20bv32) && ~fp~LONGDOUBLE(v_prenex_6[63:63], v_prenex_6[62:52], v_prenex_6[51:0]) == \old(x)) && (\exists v_prenex_5 : bv64 :: ~fp~LONGDOUBLE(v_prenex_5[63:63], v_prenex_5[62:52], v_prenex_5[51:0]) == \old(x) && ~bvadd64(exponent_less_1023, 1023bv32) == ~bvashr32(~bvand32(2146435072bv32, v_prenex_5[63:32]), 20bv32))) && x == \old(x)) && (\exists v_prenex_6 : bv64 :: msw == v_prenex_6[63:32] && ~fp~LONGDOUBLE(v_prenex_6[63:63], v_prenex_6[62:52], v_prenex_6[51:0]) == \old(x)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. SAFE Result, 6.6s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 89 SDslu, 488 SDs, 0 SdLazy, 175 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, 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: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 16 PreInvPairs, 22 NumberOfFragments, 223 HoareAnnotationTreeSize, 16 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 92 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 114 ConstructedInterpolants, 18 QuantifiedInterpolants, 16023 SizeOfPredicates, 16 NumberOfNonLiveVariables, 309 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...