./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1092c_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_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1092c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7089bbc1d64fdab3968ddd6407c4dd9659b97437 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1092c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7089bbc1d64fdab3968ddd6407c4dd9659b97437 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:59:34,942 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:59:34,944 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:59:34,951 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:59:34,952 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:59:34,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:59:34,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:59:34,954 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:59:34,955 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:59:34,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:59:34,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:59:34,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:59:34,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:59:34,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:59:34,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:59:34,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:59:34,960 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:59:34,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:59:34,963 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:59:34,964 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:59:34,965 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:59:34,966 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:59:34,968 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:59:34,968 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:59:34,968 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:59:34,969 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:59:34,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:59:34,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:59:34,970 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:59:34,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:59:34,971 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:59:34,971 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:59:34,971 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:59:34,971 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:59:34,972 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:59:34,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:59:34,973 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:59:34,980 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:59:34,981 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:59:34,981 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:59:34,981 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:59:34,982 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:59:34,982 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:59:34,982 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:59:34,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:59:34,982 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:59:34,982 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:59:34,982 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:59:34,982 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:59:34,982 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:59:34,982 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:59:34,983 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:59:34,983 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:59:34,983 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:59:34,983 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:59:34,983 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:59:34,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:59:34,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:59:34,983 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:59:34,983 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:59:34,983 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:59:34,983 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:59:34,984 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:59:34,984 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:59:34,984 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:59:34,984 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:59:34,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:59:34,984 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_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7089bbc1d64fdab3968ddd6407c4dd9659b97437 [2018-11-23 03:59:35,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:59:35,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:59:35,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:59:35,022 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:59:35,022 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:59:35,023 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1092c_true-unreach-call.c [2018-11-23 03:59:35,060 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data/a81ebd295/3b5320eef4624c56b86bbbd2a0bfe1d0/FLAG202983dfb [2018-11-23 03:59:35,414 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:59:35,414 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/sv-benchmarks/c/float-newlib/double_req_bl_1092c_true-unreach-call.c [2018-11-23 03:59:35,420 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data/a81ebd295/3b5320eef4624c56b86bbbd2a0bfe1d0/FLAG202983dfb [2018-11-23 03:59:35,827 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data/a81ebd295/3b5320eef4624c56b86bbbd2a0bfe1d0 [2018-11-23 03:59:35,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:59:35,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:59:35,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:59:35,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:59:35,835 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:59:35,836 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:59:35" (1/1) ... [2018-11-23 03:59:35,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7deb8c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:35, skipping insertion in model container [2018-11-23 03:59:35,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:59:35" (1/1) ... [2018-11-23 03:59:35,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:59:35,865 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:59:36,010 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:59:36,013 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:59:36,041 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:59:36,061 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:59:36,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36 WrapperNode [2018-11-23 03:59:36,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:59:36,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:59:36,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:59:36,062 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:59:36,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... [2018-11-23 03:59:36,078 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... [2018-11-23 03:59:36,085 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:59:36,086 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:59:36,086 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:59:36,086 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:59:36,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... [2018-11-23 03:59:36,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... [2018-11-23 03:59:36,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... [2018-11-23 03:59:36,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... [2018-11-23 03:59:36,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... [2018-11-23 03:59:36,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... [2018-11-23 03:59:36,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... [2018-11-23 03:59:36,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:59:36,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:59:36,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:59:36,163 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:59:36,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:59:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 03:59:36,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:59:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:59:36,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:59:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 03:59:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:59:36,213 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 03:59:36,214 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 03:59:36,214 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_double [2018-11-23 03:59:36,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_double [2018-11-23 03:59:36,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:59:36,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:59:36,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:59:36,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:59:36,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:59:36,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:59:36,467 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:59:36,467 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 03:59:36,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:59:36 BoogieIcfgContainer [2018-11-23 03:59:36,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:59:36,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:59:36,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:59:36,470 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:59:36,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:59:35" (1/3) ... [2018-11-23 03:59:36,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ef8d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:59:36, skipping insertion in model container [2018-11-23 03:59:36,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:36" (2/3) ... [2018-11-23 03:59:36,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ef8d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:59:36, skipping insertion in model container [2018-11-23 03:59:36,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:59:36" (3/3) ... [2018-11-23 03:59:36,476 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092c_true-unreach-call.c [2018-11-23 03:59:36,487 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:59:36,495 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:59:36,512 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:59:36,540 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:59:36,541 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:59:36,541 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:59:36,541 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:59:36,541 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:59:36,541 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:59:36,541 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:59:36,541 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:59:36,541 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:59:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 03:59:36,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:59:36,559 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:59:36,560 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 03:59:36,563 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:59:36,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:59:36,569 INFO L82 PathProgramCache]: Analyzing trace with hash -661893902, now seen corresponding path program 1 times [2018-11-23 03:59:36,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:59:36,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:59:36,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:59:36,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:59:36,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:59:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:59:36,691 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 03:59:36,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:59:36,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:59:36,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:59:36,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:59:36,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:59:36,707 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-23 03:59:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:59:36,725 INFO L93 Difference]: Finished difference Result 92 states and 135 transitions. [2018-11-23 03:59:36,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:59:36,726 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-23 03:59:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:59:36,732 INFO L225 Difference]: With dead ends: 92 [2018-11-23 03:59:36,732 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 03:59:36,735 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 03:59:36,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 03:59:36,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 03:59:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 03:59:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2018-11-23 03:59:36,765 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 25 [2018-11-23 03:59:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:59:36,765 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2018-11-23 03:59:36,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:59:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2018-11-23 03:59:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:59:36,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:59:36,766 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, 1, 1] [2018-11-23 03:59:36,766 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:59:36,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:59:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1235447049, now seen corresponding path program 1 times [2018-11-23 03:59:36,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:59:36,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:59:36,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:59:36,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:59:36,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:59:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:59:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:59:36,895 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450955, |#NULL.offset|=6442450946, |old(#NULL.base)|=6442450955, |old(#NULL.offset)|=6442450946, |old(~huge_ceil~0)|=6442450952.0, ~huge_ceil~0=6442450952.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_ceil~0 := 1.0E300; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450955, |old(#NULL.offset)|=6442450946, |old(~huge_ceil~0)|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450955, |old(#NULL.offset)|=6442450946, |old(~huge_ceil~0)|=6442450952.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #142#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret10 := ceil_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0;havoc ~j~0; VAL [ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.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);~i0~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~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume ~j0~0 < 20; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~j0~0=0, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !(~j0~0 < 0);~i~0 := ~shiftRight(1048575, ~j0~0); VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~j0~0=0, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296;#res := ~x; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~j0~0=0, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, |ceil_double_#res|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=5, ceil_double_~j0~0=0, ceil_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=6442450954.0, |ceil_double_#res|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #146#return; VAL [main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~res~0 := #t~ret10;havoc #t~ret10; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret11 := isinf_double(~res~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~hx~0;havoc ~lx~0; VAL [isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8);call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4);~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~union7;havoc #t~mem6;call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4);~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8);havoc #t~mem8;havoc #t~union9;call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset);havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [isinf_double_~hx~0=2, isinf_double_~lx~0=1, isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [isinf_double_~hx~0=2, isinf_double_~lx~0=1, isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647);~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296);~hx~0 := 2146435072 - ~hx~0;#res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=1, isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, |isinf_double_#res|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [isinf_double_~hx~0=2146435072, isinf_double_~lx~0=1, isinf_double_~x=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |isinf_double_#in~x|=6442450954.0, |isinf_double_#res|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #148#return; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume 0 == #t~ret11;havoc #t~ret11; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=6442450954.0, main_~x~0=6442450954.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450955, #NULL.offset=6442450946, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L20] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26-L70] assume ~j0~0 < 20; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27-L47] assume !(~j0~0 < 0); [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39-L40] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L16-L78] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L85] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L84] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L81-L93] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L106] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106-L109] assume 0 == #t~ret11; [L106] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450955, #NULL.offset=6442450946, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450955, old(#NULL.offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L20] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26-L70] assume ~j0~0 < 20; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27-L47] assume !(~j0~0 < 0); [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39-L40] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L16-L78] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] call ~#ew_u~1.base, ~#ew_u~1.offset := #Ultimate.alloc(8); [L85] call write~real(~x, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] call #t~mem6 := read~int(~#ew_u~1.base, 4 + ~#ew_u~1.offset, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] call write~real(#t~union7, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] call #t~mem8 := read~int(~#ew_u~1.base, ~#ew_u~1.offset, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] call write~real(#t~union9, ~#ew_u~1.base, ~#ew_u~1.offset, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] call ULTIMATE.dealloc(~#ew_u~1.base, ~#ew_u~1.offset); [L84] havoc ~#ew_u~1.base, ~#ew_u~1.offset; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L81-L93] ensures true; VAL [#in~x=6.442450954E9, #NULL.base=0, #NULL.offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L106] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106-L109] assume 0 == #t~ret11; [L106] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450955, #NULL!offset=6442450946, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27] COND FALSE !(~j0~0 < 0) [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L85] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L84] havoc ~#ew_u~1; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L106] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] COND TRUE 0 == #t~ret11 [L106] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450955, #NULL!offset=6442450946, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27] COND FALSE !(~j0~0 < 0) [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L85] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L84] havoc ~#ew_u~1; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L106] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] COND TRUE 0 == #t~ret11 [L106] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450955, #NULL!offset=6442450946, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27] COND FALSE !(~j0~0 < 0) [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L85] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L84] havoc ~#ew_u~1; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L106] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] COND TRUE 0 == #t~ret11 [L106] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450955, #NULL!offset=6442450946, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=6.442450952E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450955, old(#NULL!offset)=6442450946, old(~huge_ceil~0)=6.442450952E9, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L103] ~x~0 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L104] CALL call #t~ret10 := ceil_double(~x~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L16-L78] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~union1; [L22] havoc #t~mem0; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~union3; [L23] havoc #t~mem2; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~x=6.442450954E9] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L27] COND FALSE !(~j0~0 < 0) [L38] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L39] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L40] #res := ~x; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=6.442450954E9, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=5, ~j0~0=0, ~x=6.442450954E9] [L104] RET call #t~ret10 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=6.442450954E9, ~huge_ceil~0=1.0E300, ~x~0=6.442450954E9] [L104] ~res~0 := #t~ret10; [L104] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] CALL call #t~ret11 := isinf_double(~res~0); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L81-L93] ~x := #in~x; [L82] havoc ~hx~0; [L82] havoc ~lx~0; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=6.442450954E9] [L84] FCALL call ~#ew_u~1 := #Ultimate.alloc(8); [L85] FCALL call write~real(~x, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] FCALL call #t~mem6 := read~int({ base: ~#ew_u~1!base, offset: 4 + ~#ew_u~1!offset }, 4); [L86] ~hx~0 := (if #t~mem6 % 4294967296 % 4294967296 <= 2147483647 then #t~mem6 % 4294967296 % 4294967296 else #t~mem6 % 4294967296 % 4294967296 - 4294967296); [L86] FCALL call write~real(#t~union7, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L86] havoc #t~union7; [L86] havoc #t~mem6; [L87] FCALL call #t~mem8 := read~int({ base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 4); [L87] ~lx~0 := (if #t~mem8 % 4294967296 % 4294967296 <= 2147483647 then #t~mem8 % 4294967296 % 4294967296 else #t~mem8 % 4294967296 % 4294967296 - 4294967296); [L87] FCALL call write~real(#t~union9, { base: ~#ew_u~1!base, offset: ~#ew_u~1!offset }, 8); [L87] havoc #t~mem8; [L87] havoc #t~union9; [L84] FCALL call ULTIMATE.dealloc(~#ew_u~1); [L84] havoc ~#ew_u~1; VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~hx~0=2, ~lx~0=1, ~x=6.442450954E9] [L89] ~hx~0 := ~bitwiseAnd(~hx~0, 2147483647); [L90] ~hx~0 := (if ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, ~bitwiseOr(~lx~0, -~lx~0) / 2147483648) % 4294967296 % 4294967296 - 4294967296); [L91] ~hx~0 := 2146435072 - ~hx~0; [L92] #res := 1 - (if ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 else ~bitwiseOr(~hx~0, -~hx~0) / 2147483648 % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=6.442450954E9, #NULL!base=0, #NULL!offset=0, #res=0, ~huge_ceil~0=1.0E300, ~hx~0=2146435072, ~lx~0=1, ~x=6.442450954E9] [L106] RET call #t~ret11 := isinf_double(~res~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L106] COND TRUE 0 == #t~ret11 [L106] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L107] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=6.442450954E9, ~x~0=6.442450954E9] [L14] static const double huge_ceil = 1.0e300; VAL [\old(huge_ceil)=6442450952, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L103] double x = 1.0 / 0.0; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L104] CALL, EXPR ceil_double(x) VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, x=6442450954] [L26] COND TRUE j0 < 20 VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L27] COND FALSE !(j0 < 0) [L38] i = (0x000fffff) >> j0 VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L39] COND TRUE ((i0 & i) | i1) == 0 [L40] return x; VAL [\old(x)=6442450954, \result=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L104] RET, EXPR ceil_double(x) VAL [ceil_double(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L104] double res = ceil_double(x); [L106] CALL, EXPR isinf_double(res) VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L82] __int32_t hx, lx; VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L84] ieee_double_shape_type ew_u; [L85] ew_u.value = (x) [L86] EXPR ew_u.parts.msw [L86] (hx) = ew_u.parts.msw [L87] EXPR ew_u.parts.lsw [L87] (lx) = ew_u.parts.lsw [L89] hx &= 0x7fffffff [L90] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L91] hx = 0x7ff00000 - hx [L92] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450954, \result=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2146435072, lx=1, x=6442450954] [L106] RET, EXPR isinf_double(res) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isinf_double(res)=0, res=6442450954, x=6442450954] [L106] COND TRUE !isinf_double(res) [L107] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=6442450954, x=6442450954] ----- [2018-11-23 03:59:36,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:59:36 BoogieIcfgContainer [2018-11-23 03:59:36,970 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:59:36,971 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:59:36,971 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:59:36,971 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:59:36,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:59:36" (3/4) ... [2018-11-23 03:59:36,975 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 03:59:36,975 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:59:36,976 INFO L168 Benchmark]: Toolchain (without parser) took 1145.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 960.8 MB in the beginning and 1.1 GB in the end (delta: -116.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:59:36,978 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:59:36,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.72 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:59:36,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.45 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:59:36,979 INFO L168 Benchmark]: Boogie Preprocessor took 77.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:59:36,980 INFO L168 Benchmark]: RCFGBuilder took 304.14 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:59:36,980 INFO L168 Benchmark]: TraceAbstraction took 502.88 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 03:59:36,981 INFO L168 Benchmark]: Witness Printer took 4.62 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 03:59:36,984 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 229.72 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 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.45 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 304.14 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 502.88 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 4.62 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: 107]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 38, overapproximation of bitwiseOr at line 90, overapproximation of someBinaryArithmeticDOUBLEoperation at line 103, overapproximation of bitwiseAnd at line 89. Possible FailurePath: [L14] static const double huge_ceil = 1.0e300; VAL [\old(huge_ceil)=6442450952, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L103] double x = 1.0 / 0.0; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L104] CALL, EXPR ceil_double(x) VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, x=6442450954] [L26] COND TRUE j0 < 20 VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L27] COND FALSE !(j0 < 0) [L38] i = (0x000fffff) >> j0 VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L39] COND TRUE ((i0 & i) | i1) == 0 [L40] return x; VAL [\old(x)=6442450954, \result=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=5, j0=0, x=6442450954] [L104] RET, EXPR ceil_double(x) VAL [ceil_double(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L104] double res = ceil_double(x); [L106] CALL, EXPR isinf_double(res) VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L82] __int32_t hx, lx; VAL [\old(x)=6442450954, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=6442450954] [L84] ieee_double_shape_type ew_u; [L85] ew_u.value = (x) [L86] EXPR ew_u.parts.msw [L86] (hx) = ew_u.parts.msw [L87] EXPR ew_u.parts.lsw [L87] (lx) = ew_u.parts.lsw [L89] hx &= 0x7fffffff [L90] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L91] hx = 0x7ff00000 - hx [L92] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=6442450954, \result=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2146435072, lx=1, x=6442450954] [L106] RET, EXPR isinf_double(res) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, isinf_double(res)=0, res=6442450954, x=6442450954] [L106] COND TRUE !isinf_double(res) [L107] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=6442450954, x=6442450954] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 50 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 64 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=50occurred 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, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 576 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 03:59:38,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:59:38,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:59:38,670 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:59:38,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:59:38,672 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:59:38,673 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:59:38,675 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:59:38,676 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:59:38,677 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:59:38,678 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:59:38,678 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:59:38,679 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:59:38,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:59:38,682 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:59:38,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:59:38,683 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:59:38,685 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:59:38,687 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:59:38,688 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:59:38,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:59:38,691 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:59:38,693 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:59:38,693 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:59:38,694 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:59:38,694 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:59:38,695 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:59:38,696 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:59:38,696 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:59:38,698 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:59:38,698 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:59:38,699 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:59:38,699 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:59:38,699 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:59:38,700 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:59:38,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:59:38,702 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 03:59:38,714 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:59:38,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:59:38,715 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:59:38,715 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:59:38,716 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:59:38,716 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:59:38,716 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:59:38,716 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:59:38,716 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:59:38,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:59:38,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:59:38,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:59:38,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:59:38,717 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:59:38,717 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 03:59:38,718 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 03:59:38,718 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:59:38,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:59:38,718 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:59:38,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:59:38,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:59:38,719 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:59:38,719 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:59:38,719 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:59:38,719 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:59:38,719 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:59:38,719 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:59:38,720 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:59:38,720 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 03:59:38,720 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:59:38,720 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 03:59:38,720 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 03:59:38,720 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_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7089bbc1d64fdab3968ddd6407c4dd9659b97437 [2018-11-23 03:59:38,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:59:38,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:59:38,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:59:38,775 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:59:38,775 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:59:38,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1092c_true-unreach-call.c [2018-11-23 03:59:38,830 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data/415bbae48/303db936da4749399555d62f194d5647/FLAGcb2815bd1 [2018-11-23 03:59:39,198 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:59:39,198 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/sv-benchmarks/c/float-newlib/double_req_bl_1092c_true-unreach-call.c [2018-11-23 03:59:39,204 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data/415bbae48/303db936da4749399555d62f194d5647/FLAGcb2815bd1 [2018-11-23 03:59:39,214 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/data/415bbae48/303db936da4749399555d62f194d5647 [2018-11-23 03:59:39,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:59:39,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:59:39,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:59:39,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:59:39,222 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:59:39,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2a43b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39, skipping insertion in model container [2018-11-23 03:59:39,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:59:39,254 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:59:39,410 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:59:39,415 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:59:39,441 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:59:39,463 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:59:39,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39 WrapperNode [2018-11-23 03:59:39,464 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:59:39,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:59:39,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:59:39,465 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:59:39,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:59:39,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:59:39,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:59:39,485 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:59:39,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... [2018-11-23 03:59:39,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:59:39,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:59:39,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:59:39,575 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:59:39,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:59:39,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 03:59:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:59:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:59:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:59:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 03:59:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure isinf_double [2018-11-23 03:59:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure isinf_double [2018-11-23 03:59:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 03:59:39,620 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_double [2018-11-23 03:59:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_double [2018-11-23 03:59:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:59:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:59:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:59:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:59:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 03:59:39,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:59:39,774 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:59:40,151 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 03:59:41,025 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:59:41,026 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 03:59:41,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:59:41 BoogieIcfgContainer [2018-11-23 03:59:41,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:59:41,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:59:41,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:59:41,030 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:59:41,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:59:39" (1/3) ... [2018-11-23 03:59:41,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f7d9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:59:41, skipping insertion in model container [2018-11-23 03:59:41,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:59:39" (2/3) ... [2018-11-23 03:59:41,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f7d9e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:59:41, skipping insertion in model container [2018-11-23 03:59:41,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:59:41" (3/3) ... [2018-11-23 03:59:41,034 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092c_true-unreach-call.c [2018-11-23 03:59:41,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:59:41,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:59:41,063 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:59:41,087 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:59:41,087 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:59:41,088 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:59:41,088 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:59:41,088 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:59:41,088 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:59:41,088 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:59:41,088 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:59:41,088 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:59:41,105 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-23 03:59:41,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 03:59:41,110 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:59:41,111 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 03:59:41,112 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:59:41,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:59:41,116 INFO L82 PathProgramCache]: Analyzing trace with hash -721738728, now seen corresponding path program 1 times [2018-11-23 03:59:41,119 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:59:41,120 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 03:59:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:59:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:59:41,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:59:41,205 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 03:59:41,206 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:59:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:59:41,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:59:41,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:59:41,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:59:41,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:59:41,229 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-23 03:59:41,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:59:41,251 INFO L93 Difference]: Finished difference Result 90 states and 133 transitions. [2018-11-23 03:59:41,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:59:41,252 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 24 [2018-11-23 03:59:41,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:59:41,261 INFO L225 Difference]: With dead ends: 90 [2018-11-23 03:59:41,261 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 03:59:41,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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 03:59:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 03:59:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 03:59:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 03:59:41,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2018-11-23 03:59:41,294 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 24 [2018-11-23 03:59:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:59:41,294 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2018-11-23 03:59:41,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:59:41,295 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2018-11-23 03:59:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 03:59:41,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:59:41,296 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, 1] [2018-11-23 03:59:41,296 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:59:41,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:59:41,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1549059375, now seen corresponding path program 1 times [2018-11-23 03:59:41,298 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 03:59:41,299 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 03:59:41,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:59:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:59:41,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:59:41,475 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:59:41,476 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 03:59:41,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 03:59:41,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 03:59:41,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 03:59:41,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 03:59:41,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 03:59:41,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 03:59:41,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:59:41,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 03:59:41,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 03:59:41,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 03:59:43,690 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-23 03:59:45,765 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 03:59:47,838 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 03:59:49,904 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 03:59:50,008 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 03:59:50,008 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 03:59:50,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:59:50,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 03:59:50,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 03:59:50,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 03:59:50,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:59:50,026 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand 9 states. [2018-11-23 03:59:52,189 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-23 03:59:54,268 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 03:59:56,373 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-23 04:00:00,529 WARN L180 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2018-11-23 04:00:06,664 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-23 04:00:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:00:15,178 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2018-11-23 04:00:15,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 04:00:15,181 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-11-23 04:00:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:00:15,183 INFO L225 Difference]: With dead ends: 83 [2018-11-23 04:00:15,183 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 04:00:15,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-11-23 04:00:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 04:00:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-11-23 04:00:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 04:00:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 04:00:15,191 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 26 [2018-11-23 04:00:15,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:00:15,191 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 04:00:15,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 04:00:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 04:00:15,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:00:15,192 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:00:15,193 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, 1] [2018-11-23 04:00:15,193 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:00:15,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:00:15,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1162953480, now seen corresponding path program 1 times [2018-11-23 04:00:15,194 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 04:00:15,195 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 04:00:15,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:00:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:00:15,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:00:15,319 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:00:15,320 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:00:15,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 04:00:15,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 04:00:15,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:00:15,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 04:00:15,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 04:00:15,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:00:15,394 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:00:15,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:00:15,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:00:15,408 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 04:00:15,507 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 04:00:15,508 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 04:00:15,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:00:15,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 04:00:15,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 04:00:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:00:15,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:00:15,525 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 7 states. [2018-11-23 04:00:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:00:17,034 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-23 04:00:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 04:00:17,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 04:00:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:00:17,036 INFO L225 Difference]: With dead ends: 63 [2018-11-23 04:00:17,036 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 04:00:17,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:00:17,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 04:00:17,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 04:00:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 04:00:17,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-23 04:00:17,040 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 26 [2018-11-23 04:00:17,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:00:17,040 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-23 04:00:17,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 04:00:17,040 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-23 04:00:17,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:00:17,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:00:17,041 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, 1] [2018-11-23 04:00:17,041 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:00:17,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:00:17,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1463112616, now seen corresponding path program 1 times [2018-11-23 04:00:17,042 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 04:00:17,042 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 04:00:17,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:00:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:00:17,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:00:18,034 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:00:18,034 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:00:18,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 04:00:18,067 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:00:18,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 04:00:18,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:00:18,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 04:00:18,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 04:00:18,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:00:18,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:00:18,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:00:18,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:00:18,103 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:18 [2018-11-23 04:00:18,711 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 04:00:18,711 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 04:00:18,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:00:18,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 04:00:18,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 04:00:18,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:00:18,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:00:18,720 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-11-23 04:00:19,945 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 04:00:21,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:00:21,959 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-23 04:00:21,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:00:21,960 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-11-23 04:00:21,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:00:21,960 INFO L225 Difference]: With dead ends: 34 [2018-11-23 04:00:21,960 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 04:00:21,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 04:00:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 04:00:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 04:00:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 04:00:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-11-23 04:00:21,967 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2018-11-23 04:00:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:00:21,967 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-11-23 04:00:21,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 04:00:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-11-23 04:00:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 04:00:21,967 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 04:00:21,967 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, 1] [2018-11-23 04:00:21,967 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 04:00:21,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:00:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1756515623, now seen corresponding path program 1 times [2018-11-23 04:00:21,968 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 04:00:21,968 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 04:00:21,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:00:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:00:22,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:00:22,114 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:00:22,114 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 04:00:22,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 04:00:22,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 04:00:22,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 04:00:22,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 04:00:22,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-23 04:00:22,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 04:00:22,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:00:22,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 04:00:22,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 04:00:22,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 04:00:22,264 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 04:00:22,265 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 04:00:22,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:00:22,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 04:00:22,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 04:00:22,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:00:22,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:00:22,274 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 7 states. [2018-11-23 04:00:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:00:22,578 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-11-23 04:00:22,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:00:22,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 04:00:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 04:00:22,579 INFO L225 Difference]: With dead ends: 27 [2018-11-23 04:00:22,579 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 04:00:22,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:00:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 04:00:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 04:00:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 04:00:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 04:00:22,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-23 04:00:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 04:00:22,580 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 04:00:22,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 04:00:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 04:00:22,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 04:00:22,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 04:00:22,643 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 04:00:22,643 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 04:00:22,643 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:00:22,643 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 88) no Hoare annotation was computed. [2018-11-23 04:00:22,643 INFO L444 ceAbstractionStarter]: At program point L83-2(lines 83 88) the Hoare annotation is: (= isinf_double_~x |isinf_double_#in~x|) [2018-11-23 04:00:22,643 INFO L448 ceAbstractionStarter]: For program point L83-3(lines 83 88) no Hoare annotation was computed. [2018-11-23 04:00:22,643 INFO L448 ceAbstractionStarter]: For program point isinf_doubleFINAL(lines 81 93) no Hoare annotation was computed. [2018-11-23 04:00:22,643 INFO L448 ceAbstractionStarter]: For program point isinf_doubleEXIT(lines 81 93) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L451 ceAbstractionStarter]: At program point isinf_doubleENTRY(lines 81 93) the Hoare annotation is: true [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 47) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 24) the Hoare annotation is: (= |ceil_double_#in~x| ceil_double_~x) [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 70) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 35) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 36) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 69) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 52) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 46) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 35) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 67) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 58 67) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L451 ceAbstractionStarter]: At program point ceil_doubleENTRY(lines 16 78) the Hoare annotation is: true [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-11-23 04:00:22,644 INFO L448 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 76) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 16 78) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 71 76) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point ceil_doubleFINAL(lines 16 78) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point ceil_doubleEXIT(lines 16 78) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 64) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 63 64) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 66) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 70) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 56) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 40) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 04:00:22,645 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 04:00:22,646 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 04:00:22,646 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 04:00:22,646 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 95 111) the Hoare annotation is: true [2018-11-23 04:00:22,646 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 95 111) no Hoare annotation was computed. [2018-11-23 04:00:22,646 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-11-23 04:00:22,646 INFO L444 ceAbstractionStarter]: At program point L106(line 106) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53)))) (and (= main_~x~0 .cse0) (= main_~res~0 (fp.add roundNearestTiesToEven .cse0 .cse0)))) [2018-11-23 04:00:22,646 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 106 109) no Hoare annotation was computed. [2018-11-23 04:00:22,646 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 95 111) no Hoare annotation was computed. [2018-11-23 04:00:22,646 INFO L444 ceAbstractionStarter]: At program point L104(line 104) the Hoare annotation is: (= main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (_ +zero 11 53))) [2018-11-23 04:00:22,646 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2018-11-23 04:00:22,646 INFO L448 ceAbstractionStarter]: For program point L104-1(line 104) no Hoare annotation was computed. [2018-11-23 04:00:22,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 04:00:22 BoogieIcfgContainer [2018-11-23 04:00:22,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 04:00:22,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 04:00:22,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 04:00:22,655 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 04:00:22,656 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:59:41" (3/4) ... [2018-11-23 04:00:22,658 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 04:00:22,662 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 04:00:22,663 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isinf_double [2018-11-23 04:00:22,663 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ceil_double [2018-11-23 04:00:22,663 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 04:00:22,667 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2018-11-23 04:00:22,667 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 04:00:22,667 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 04:00:22,688 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 04:00:22,688 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 04:00:22,708 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9649afe5-b73c-49fe-af68-066034b2832a/bin-2019/uautomizer/witness.graphml [2018-11-23 04:00:22,708 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 04:00:22,709 INFO L168 Benchmark]: Toolchain (without parser) took 43491.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 949.7 MB in the beginning and 813.2 MB in the end (delta: 136.5 MB). Peak memory consumption was 275.5 MB. Max. memory is 11.5 GB. [2018-11-23 04:00:22,709 INFO L168 Benchmark]: CDTParser took 0.19 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 04:00:22,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 245.84 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 04:00:22,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.23 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 04:00:22,710 INFO L168 Benchmark]: Boogie Preprocessor took 89.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 04:00:22,710 INFO L168 Benchmark]: RCFGBuilder took 1451.56 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: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. [2018-11-23 04:00:22,711 INFO L168 Benchmark]: TraceAbstraction took 41627.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 820.2 MB in the end (delta: 277.2 MB). Peak memory consumption was 277.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:00:22,711 INFO L168 Benchmark]: Witness Printer took 52.99 ms. Allocated memory is still 1.2 GB. Free memory was 820.2 MB in the beginning and 813.2 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-23 04:00:22,712 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.19 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 245.84 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 20.23 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 89.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1451.56 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: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41627.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 820.2 MB in the end (delta: 277.2 MB). Peak memory consumption was 277.2 MB. Max. memory is 11.5 GB. * Witness Printer took 52.99 ms. Allocated memory is still 1.2 GB. Free memory was 820.2 MB in the beginning and 813.2 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: 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: 83]: Loop Invariant Derived loop invariant: x == \old(x) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 1 error locations. SAFE Result, 41.5s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 30.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 149 SDtfs, 216 SDslu, 421 SDs, 0 SdLazy, 368 SolverSat, 31 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 26.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 18 PreInvPairs, 21 NumberOfFragments, 45 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 123 ConstructedInterpolants, 26 QuantifiedInterpolants, 22204 SizeOfPredicates, 20 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 44 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...