./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1092b_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_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1092b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 0d806ca1b262345211037ccd3e4a22cabffa047b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1092b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 0d806ca1b262345211037ccd3e4a22cabffa047b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:21:09,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:21:09,282 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:21:09,288 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:21:09,288 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:21:09,289 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:21:09,289 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:21:09,291 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:21:09,292 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:21:09,292 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:21:09,293 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:21:09,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:21:09,294 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:21:09,294 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:21:09,295 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:21:09,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:21:09,296 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:21:09,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:21:09,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:21:09,299 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:21:09,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:21:09,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:21:09,302 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:21:09,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:21:09,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:21:09,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:21:09,304 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:21:09,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:21:09,305 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:21:09,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:21:09,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:21:09,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:21:09,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:21:09,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:21:09,307 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:21:09,307 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:21:09,308 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:21:09,315 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:21:09,315 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:21:09,315 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:21:09,316 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:21:09,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:21:09,316 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:21:09,316 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:21:09,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:21:09,317 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:21:09,317 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:21:09,317 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:21:09,317 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:21:09,317 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:21:09,317 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:21:09,317 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:21:09,318 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:21:09,318 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:21:09,318 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:21:09,318 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:21:09,318 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:21:09,318 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:21:09,318 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:21:09,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:21:09,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:21:09,319 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:21:09,319 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:21:09,319 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:21:09,319 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:21:09,319 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:21:09,319 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:21:09,320 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_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 -> 0d806ca1b262345211037ccd3e4a22cabffa047b [2018-11-23 12:21:09,344 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:21:09,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:21:09,355 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:21:09,356 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:21:09,357 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:21:09,357 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1092b_true-unreach-call.c [2018-11-23 12:21:09,398 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data/c769a23bf/c27bc9c253284d2eb77bc3b6358ea725/FLAGe08e33d1d [2018-11-23 12:21:09,808 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:21:09,808 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/sv-benchmarks/c/float-newlib/double_req_bl_1092b_true-unreach-call.c [2018-11-23 12:21:09,814 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data/c769a23bf/c27bc9c253284d2eb77bc3b6358ea725/FLAGe08e33d1d [2018-11-23 12:21:09,824 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data/c769a23bf/c27bc9c253284d2eb77bc3b6358ea725 [2018-11-23 12:21:09,826 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:21:09,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:21:09,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:09,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:21:09,830 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:21:09,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:09" (1/1) ... [2018-11-23 12:21:09,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9b2349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:09, skipping insertion in model container [2018-11-23 12:21:09,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:09" (1/1) ... [2018-11-23 12:21:09,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:21:09,853 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:21:09,973 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:09,976 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:21:09,998 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:10,013 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:21:10,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10 WrapperNode [2018-11-23 12:21:10,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:10,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:10,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:21:10,014 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:21:10,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... [2018-11-23 12:21:10,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... [2018-11-23 12:21:10,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:10,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:21:10,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:21:10,066 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:21:10,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... [2018-11-23 12:21:10,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... [2018-11-23 12:21:10,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... [2018-11-23 12:21:10,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... [2018-11-23 12:21:10,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... [2018-11-23 12:21:10,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... [2018-11-23 12:21:10,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... [2018-11-23 12:21:10,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:21:10,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:21:10,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:21:10,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:21:10,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 12:21:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 12:21:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:21:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:21:10,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:21:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 12:21:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:21:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_double [2018-11-23 12:21:10,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_double [2018-11-23 12:21:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:21:10,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:21:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:21:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:21:10,120 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:21:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:21:10,309 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:21:10,309 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:21:10,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:10 BoogieIcfgContainer [2018-11-23 12:21:10,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:21:10,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:21:10,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:21:10,313 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:21:10,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:21:09" (1/3) ... [2018-11-23 12:21:10,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99fb0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:10, skipping insertion in model container [2018-11-23 12:21:10,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:10" (2/3) ... [2018-11-23 12:21:10,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99fb0b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:10, skipping insertion in model container [2018-11-23 12:21:10,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:10" (3/3) ... [2018-11-23 12:21:10,316 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092b_true-unreach-call.c [2018-11-23 12:21:10,323 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:21:10,328 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:21:10,338 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:21:10,356 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:21:10,356 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:21:10,356 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:21:10,356 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:21:10,357 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:21:10,357 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:21:10,357 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:21:10,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:21:10,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:21:10,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 12:21:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:21:10,372 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:10,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:10,374 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:10,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:10,377 INFO L82 PathProgramCache]: Analyzing trace with hash 593324774, now seen corresponding path program 1 times [2018-11-23 12:21:10,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:10,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:10,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:10,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:10,468 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 12:21:10,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:10,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:21:10,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:21:10,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:21:10,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:21:10,482 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 12:21:10,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:10,498 INFO L93 Difference]: Finished difference Result 76 states and 114 transitions. [2018-11-23 12:21:10,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:21:10,499 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 12:21:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:10,506 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:21:10,506 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:21:10,508 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 12:21:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:21:10,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:21:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:21:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2018-11-23 12:21:10,533 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 18 [2018-11-23 12:21:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:10,534 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2018-11-23 12:21:10,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:21:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2018-11-23 12:21:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:21:10,534 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:10,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:10,535 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:10,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:10,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1268028223, now seen corresponding path program 1 times [2018-11-23 12:21:10,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:10,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:10,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:10,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:21:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:21:10,598 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=10737418245, |#NULL.offset|=10737418241, |old(#NULL.base)|=10737418245, |old(#NULL.offset)|=10737418241, |old(~huge_ceil~0)|=10737418244.0, ~huge_ceil~0=10737418244.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)|=10737418245, |old(#NULL.offset)|=10737418241, |old(~huge_ceil~0)|=10737418244.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=10737418245, |old(#NULL.offset)|=10737418241, |old(~huge_ceil~0)|=10737418244.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #125#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x~0 := 0.0; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret6 := ceil_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=0.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=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=0.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=(- 2147483648), ceil_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=(- 2147483648), ceil_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=(- 2147483648), ceil_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume ~j0~0 < 20; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=(- 2147483648), ceil_double_~j0~0=0, ceil_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=0.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=(- 2147483648), ceil_double_~j0~0=0, ceil_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=0.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=(- 2147483648), ceil_double_~j0~0=0, ceil_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=0.0, |ceil_double_#res|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [ceil_double_~i0~0=(- 2147483648), ceil_double_~i1~0=(- 2147483648), ceil_double_~j0~0=0, ceil_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_double_#in~x|=0.0, |ceil_double_#res|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #129#return; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=0.0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~res~0 := #t~ret6;havoc #t~ret6; VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10737418245, #NULL.offset=10737418241, old(#NULL.base)=10737418245, old(#NULL.offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0737418244E10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~huge_ceil~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418245, old(#NULL.offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418245, old(#NULL.offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L91] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] CALL call #t~ret6 := ceil_double(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=0.0] [L23] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L23] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L29-L73] assume ~j0~0 < 20; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L30-L50] assume !(~j0~0 < 0); [L41] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L42-L43] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L43] #res := ~x; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L19-L81] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L92] RET call #t~ret6 := ceil_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0.0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] ~res~0 := #t~ret6; [L92] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L95-L98] assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L96] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=10737418245, #NULL.offset=10737418241, old(#NULL.base)=10737418245, old(#NULL.offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0737418244E10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L17] ~huge_ceil~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418245, old(#NULL.offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=10737418245, old(#NULL.offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L91] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] CALL call #t~ret6 := ceil_double(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300] [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~x=0.0] [L23] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L23] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L29-L73] assume ~j0~0 < 20; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L30-L50] assume !(~j0~0 < 0); [L41] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L42-L43] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L43] #res := ~x; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L19-L81] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L92] RET call #t~ret6 := ceil_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=0.0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] ~res~0 := #t~ret6; [L92] havoc #t~ret6; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L95-L98] assume ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L96] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418245, #NULL!offset=10737418241, old(#NULL!base)=10737418245, old(#NULL!offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0737418244E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418245, old(#NULL!offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L91] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] CALL call #t~ret6 := ceil_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=0.0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L29] COND TRUE ~j0~0 < 20 VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L30] COND FALSE !(~j0~0 < 0) [L41] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L42] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L43] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L92] RET call #t~ret6 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0.0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] ~res~0 := #t~ret6; [L92] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L95] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L96] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418245, #NULL!offset=10737418241, old(#NULL!base)=10737418245, old(#NULL!offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0737418244E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418245, old(#NULL!offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L91] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] CALL call #t~ret6 := ceil_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=0.0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L29] COND TRUE ~j0~0 < 20 VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L30] COND FALSE !(~j0~0 < 0) [L41] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L42] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L43] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L92] RET call #t~ret6 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0.0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] ~res~0 := #t~ret6; [L92] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L95] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L96] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418245, #NULL!offset=10737418241, old(#NULL!base)=10737418245, old(#NULL!offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0737418244E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418245, old(#NULL!offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L91] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] CALL call #t~ret6 := ceil_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=0.0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L29] COND TRUE ~j0~0 < 20 VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L30] COND FALSE !(~j0~0 < 0) [L41] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L42] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L43] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L92] RET call #t~ret6 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0.0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] ~res~0 := #t~ret6; [L92] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L95] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L96] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=10737418245, #NULL!offset=10737418241, old(#NULL!base)=10737418245, old(#NULL!offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0737418244E10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L17] ~huge_ceil~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=10737418245, old(#NULL!offset)=10737418241, old(~huge_ceil~0)=1.0737418244E10, ~huge_ceil~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L91] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] CALL call #t~ret6 := ceil_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300] [L19-L81] ~x := #in~x; [L20] havoc ~i0~0; [L20] havoc ~i1~0; [L20] havoc ~j0~0; [L21] havoc ~i~0; [L21] havoc ~j~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~x=0.0] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L28] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~x=0.0] [L29] COND TRUE ~j0~0 < 20 VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L30] COND FALSE !(~j0~0 < 0) [L41] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L42] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L43] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~huge_ceil~0=1.0E300, ~i0~0=-2147483648, ~i1~0=-2147483648, ~j0~0=0, ~x=0.0] [L92] RET call #t~ret6 := ceil_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=0.0, ~huge_ceil~0=1.0E300, ~x~0=0.0] [L92] ~res~0 := #t~ret6; [L92] havoc #t~ret6; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L95] COND TRUE ~someBinaryDOUBLEComparisonOperation(~res~0, ~x~0) VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L96] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L17] static const double huge_ceil = 1.0e300; VAL [\old(huge_ceil)=10737418244, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L91] double x = 0.0; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L92] CALL, EXPR ceil_double(x) VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L20] __int32_t i0, i1, j0; [L21] __uint32_t i, j; VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (i0) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (i1) = ew_u.parts.lsw [L28] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=-2147483648, x=0] [L29] COND TRUE j0 < 20 VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=-2147483648, j0=0, x=0] [L30] COND FALSE !(j0 < 0) [L41] i = (0x000fffff) >> j0 VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=-2147483648, j0=0, x=0] [L42] COND TRUE ((i0 & i) | i1) == 0 [L43] return x; VAL [\old(x)=0, \result=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=-2147483648, j0=0, x=0] [L92] RET, EXPR ceil_double(x) VAL [ceil_double(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L92] double res = ceil_double(x); [L95] COND TRUE res != x VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, x=0] [L96] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, x=0] ----- [2018-11-23 12:21:10,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:21:10 BoogieIcfgContainer [2018-11-23 12:21:10,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:21:10,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:21:10,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:21:10,637 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:21:10,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:10" (3/4) ... [2018-11-23 12:21:10,640 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:21:10,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:21:10,641 INFO L168 Benchmark]: Toolchain (without parser) took 814.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -122.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:10,642 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:21:10,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 186.22 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:10,643 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:10,643 INFO L168 Benchmark]: Boogie Preprocessor took 19.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:10,644 INFO L168 Benchmark]: RCFGBuilder took 224.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:10,644 INFO L168 Benchmark]: TraceAbstraction took 326.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:10,645 INFO L168 Benchmark]: Witness Printer took 3.06 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 12:21:10,648 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 186.22 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -192.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 326.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.06 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: 96]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 41, overapproximation of bitwiseOr at line 42, overapproximation of bitwiseAnd at line 28, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L17] static const double huge_ceil = 1.0e300; VAL [\old(huge_ceil)=10737418244, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L91] double x = 0.0; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L92] CALL, EXPR ceil_double(x) VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L20] __int32_t i0, i1, j0; [L21] __uint32_t i, j; VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (i0) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (i1) = ew_u.parts.lsw [L28] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=-2147483648, x=0] [L29] COND TRUE j0 < 20 VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=-2147483648, j0=0, x=0] [L30] COND FALSE !(j0 < 0) [L41] i = (0x000fffff) >> j0 VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=-2147483648, j0=0, x=0] [L42] COND TRUE ((i0 & i) | i1) == 0 [L43] return x; VAL [\old(x)=0, \result=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-2147483648, i1=-2147483648, j0=0, x=0] [L92] RET, EXPR ceil_double(x) VAL [ceil_double(x)=0, huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L92] double res = ceil_double(x); [L95] COND TRUE res != x VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, x=0] [L96] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 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=42occurred 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, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 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 12:21:12,062 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:21:12,064 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:21:12,072 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:21:12,073 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:21:12,073 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:21:12,074 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:21:12,075 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:21:12,076 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:21:12,077 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:21:12,078 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:21:12,078 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:21:12,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:21:12,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:21:12,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:21:12,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:21:12,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:21:12,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:21:12,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:21:12,085 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:21:12,086 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:21:12,087 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:21:12,088 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:21:12,088 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:21:12,089 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:21:12,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:21:12,090 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:21:12,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:21:12,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:21:12,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:21:12,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:21:12,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:21:12,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:21:12,093 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:21:12,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:21:12,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:21:12,094 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 12:21:12,104 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:21:12,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:21:12,105 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:21:12,105 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:21:12,106 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:21:12,106 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:21:12,106 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:21:12,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:21:12,106 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:21:12,107 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:21:12,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:21:12,107 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:21:12,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:21:12,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:21:12,107 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 12:21:12,107 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 12:21:12,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:21:12,108 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:21:12,108 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:21:12,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:21:12,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:21:12,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:21:12,108 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:21:12,108 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:21:12,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:21:12,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:21:12,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:21:12,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:21:12,109 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 12:21:12,109 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:21:12,109 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 12:21:12,110 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 12:21:12,110 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_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 -> 0d806ca1b262345211037ccd3e4a22cabffa047b [2018-11-23 12:21:12,140 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:21:12,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:21:12,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:21:12,152 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:21:12,152 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:21:12,153 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1092b_true-unreach-call.c [2018-11-23 12:21:12,195 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data/e5a10dde0/912f5f11bbc644128fa91a87ae610fa2/FLAG79c624431 [2018-11-23 12:21:12,528 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:21:12,528 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/sv-benchmarks/c/float-newlib/double_req_bl_1092b_true-unreach-call.c [2018-11-23 12:21:12,532 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data/e5a10dde0/912f5f11bbc644128fa91a87ae610fa2/FLAG79c624431 [2018-11-23 12:21:12,957 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/data/e5a10dde0/912f5f11bbc644128fa91a87ae610fa2 [2018-11-23 12:21:12,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:21:12,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:21:12,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:12,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:21:12,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:21:12,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:12" (1/1) ... [2018-11-23 12:21:12,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d872129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:12, skipping insertion in model container [2018-11-23 12:21:12,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:12" (1/1) ... [2018-11-23 12:21:12,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:21:12,987 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:21:13,104 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:13,108 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:21:13,125 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:13,141 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:21:13,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13 WrapperNode [2018-11-23 12:21:13,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:13,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:13,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:21:13,142 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:21:13,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... [2018-11-23 12:21:13,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... [2018-11-23 12:21:13,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:13,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:21:13,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:21:13,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:21:13,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... [2018-11-23 12:21:13,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... [2018-11-23 12:21:13,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... [2018-11-23 12:21:13,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... [2018-11-23 12:21:13,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... [2018-11-23 12:21:13,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... [2018-11-23 12:21:13,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... [2018-11-23 12:21:13,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:21:13,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:21:13,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:21:13,186 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:21:13,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 12:21:13,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 12:21:13,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:21:13,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:21:13,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:21:13,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 12:21:13,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 12:21:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_double [2018-11-23 12:21:13,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_double [2018-11-23 12:21:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:21:13,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:21:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:21:13,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:21:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 12:21:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:21:13,418 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 12:21:14,448 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:21:14,448 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:21:14,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:14 BoogieIcfgContainer [2018-11-23 12:21:14,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:21:14,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:21:14,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:21:14,452 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:21:14,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:21:12" (1/3) ... [2018-11-23 12:21:14,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fabe11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:14, skipping insertion in model container [2018-11-23 12:21:14,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:13" (2/3) ... [2018-11-23 12:21:14,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47fabe11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:14, skipping insertion in model container [2018-11-23 12:21:14,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:14" (3/3) ... [2018-11-23 12:21:14,454 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092b_true-unreach-call.c [2018-11-23 12:21:14,460 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:21:14,464 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:21:14,476 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:21:14,494 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:21:14,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:21:14,494 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:21:14,494 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:21:14,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:21:14,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:21:14,495 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:21:14,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:21:14,495 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:21:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 12:21:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:21:14,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:14,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:14,515 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:14,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash 593324774, now seen corresponding path program 1 times [2018-11-23 12:21:14,522 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:21:14,522 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 12:21:14,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:14,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:14,580 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 12:21:14,580 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:21:14,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:14,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:21:14,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:21:14,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:21:14,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:21:14,608 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 12:21:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:14,622 INFO L93 Difference]: Finished difference Result 76 states and 114 transitions. [2018-11-23 12:21:14,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:21:14,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 12:21:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:14,630 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:21:14,630 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:21:14,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 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 12:21:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:21:14,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:21:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:21:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2018-11-23 12:21:14,657 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 52 transitions. Word has length 18 [2018-11-23 12:21:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:14,657 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 52 transitions. [2018-11-23 12:21:14,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:21:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 52 transitions. [2018-11-23 12:21:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:21:14,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:14,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:14,659 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:14,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1268028223, now seen corresponding path program 1 times [2018-11-23 12:21:14,659 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:21:14,660 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 12:21:14,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:14,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:14,845 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 12:21:14,846 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:21:14,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:14,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:21:14,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:21:14,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:21:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:21:14,854 INFO L87 Difference]: Start difference. First operand 38 states and 52 transitions. Second operand 7 states. [2018-11-23 12:21:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:15,849 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-11-23 12:21:15,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:21:15,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:21:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:15,852 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:21:15,852 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:21:15,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:21:15,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:21:15,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-11-23 12:21:15,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:21:15,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2018-11-23 12:21:15,857 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 19 [2018-11-23 12:21:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:15,857 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2018-11-23 12:21:15,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:21:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-11-23 12:21:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:21:15,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:15,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:15,858 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:15,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:15,859 INFO L82 PathProgramCache]: Analyzing trace with hash 147804600, now seen corresponding path program 1 times [2018-11-23 12:21:15,859 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:21:15,859 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 12:21:15,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:15,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:16,415 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-11-23 12:21:16,962 WARN L180 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 12:21:17,795 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 12:21:17,797 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 12:21:17,797 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:21:17,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:17,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:21:17,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:21:17,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:21:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:21:17,806 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand 7 states. [2018-11-23 12:21:19,025 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 12:21:21,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:21,239 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 12:21:21,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:21:21,240 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 12:21:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:21,241 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:21:21,241 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:21:21,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:21:21,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:21:21,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:21:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:21:21,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 12:21:21,245 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 19 [2018-11-23 12:21:21,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:21,246 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 12:21:21,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:21:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 12:21:21,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:21:21,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:21,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:21,247 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:21,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:21,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1067163641, now seen corresponding path program 1 times [2018-11-23 12:21:21,247 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:21:21,247 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 12:21:21,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:21,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:23,118 WARN L180 SmtUtils]: Spent 823.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 12:21:23,124 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 12:21:23,124 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:21:23,134 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:23,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:21:23,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:21:23,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:21:23,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:21:23,134 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 6 states. [2018-11-23 12:21:25,216 WARN L180 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 12:21:27,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:27,184 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 12:21:27,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:21:27,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 12:21:27,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:27,186 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:21:27,186 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:21:27,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:21:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:21:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:21:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:21:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-23 12:21:27,189 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 22 [2018-11-23 12:21:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:27,189 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-23 12:21:27,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:21:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 12:21:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:21:27,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:27,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:27,190 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:27,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:27,190 INFO L82 PathProgramCache]: Analyzing trace with hash -232086029, now seen corresponding path program 1 times [2018-11-23 12:21:27,190 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:21:27,191 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/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 12:21:27,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:27,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:27,337 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 45 treesize of output 39 [2018-11-23 12:21:27,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 39 treesize of output 36 [2018-11-23 12:21:27,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 15 [2018-11-23 12:21:27,356 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:27,363 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:27,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:27,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:27,369 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:15 [2018-11-23 12:21:27,437 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 12:21:27,437 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:21:27,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:27,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 12:21:27,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:21:27,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:21:27,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:21:27,449 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 8 states. [2018-11-23 12:21:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:28,193 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-11-23 12:21:28,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:21:28,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-23 12:21:28,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:28,195 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:21:28,195 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:21:28,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:21:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:21:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:21:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:21:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-23 12:21:28,198 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 23 [2018-11-23 12:21:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:28,198 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-23 12:21:28,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:21:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-23 12:21:28,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:21:28,199 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:28,199 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 12:21:28,199 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:28,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:28,200 INFO L82 PathProgramCache]: Analyzing trace with hash 785443165, now seen corresponding path program 1 times [2018-11-23 12:21:28,200 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:21:28,200 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 12:21:28,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:28,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:28,333 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:28,334 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:28,335 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 48 treesize of output 56 [2018-11-23 12:21:28,376 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:21:28,384 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 37 treesize of output 35 [2018-11-23 12:21:28,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:28,402 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 35 treesize of output 27 [2018-11-23 12:21:28,415 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 23 treesize of output 9 [2018-11-23 12:21:28,416 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:28,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:28,430 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 12:21:28,440 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 12:21:28,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:18 [2018-11-23 12:21:28,495 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 12:21:28,496 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:21:28,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:28,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:21:28,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:21:28,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:21:28,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:21:28,505 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 6 states. [2018-11-23 12:21:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:29,694 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-11-23 12:21:29,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:21:29,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 12:21:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:29,695 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:21:29,695 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:21:29,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:21:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:21:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:21:29,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:21:29,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2018-11-23 12:21:29,698 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 24 [2018-11-23 12:21:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:29,698 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2018-11-23 12:21:29,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:21:29,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2018-11-23 12:21:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:21:29,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:29,699 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 12:21:29,699 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:29,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:29,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1465501535, now seen corresponding path program 1 times [2018-11-23 12:21:29,699 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 12:21:29,700 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 12:21:29,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:29,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:29,809 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 15 treesize of output 13 [2018-11-23 12:21:29,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 13 treesize of output 16 [2018-11-23 12:21:29,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 12:21:29,821 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:29,823 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:29,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:29,830 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 12:21:29,830 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:14 [2018-11-23 12:21:29,960 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 51 treesize of output 45 [2018-11-23 12:21:29,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 45 treesize of output 42 [2018-11-23 12:21:29,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 12:21:29,979 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:29,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:29,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:30,000 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 12:21:30,000 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:34 [2018-11-23 12:21:30,234 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 12:21:30,234 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 12:21:30,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:30,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 12:21:30,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:21:30,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:21:30,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:21:30,243 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 12 states. [2018-11-23 12:21:31,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:31,182 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2018-11-23 12:21:31,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:21:31,183 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-11-23 12:21:31,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:31,184 INFO L225 Difference]: With dead ends: 25 [2018-11-23 12:21:31,184 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 12:21:31,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:21:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 12:21:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 12:21:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 12:21:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:21:31,185 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-11-23 12:21:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:31,185 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:21:31,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:21:31,185 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:21:31,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:31,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 12:21:31,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:21:31,295 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:21:31,295 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:21:31,295 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 39) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L60(lines 60 72) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 55) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 49) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 38) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L45-2(lines 45 46) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 79) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 19 81) no Hoare annotation was computed. [2018-11-23 12:21:31,296 INFO L448 ceAbstractionStarter]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2018-11-23 12:21:31,297 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 67) no Hoare annotation was computed. [2018-11-23 12:21:31,297 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 66 67) no Hoare annotation was computed. [2018-11-23 12:21:31,297 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 69) no Hoare annotation was computed. [2018-11-23 12:21:31,297 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 73) no Hoare annotation was computed. [2018-11-23 12:21:31,297 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 59) no Hoare annotation was computed. [2018-11-23 12:21:31,297 INFO L451 ceAbstractionStarter]: At program point ceil_doubleENTRY(lines 19 81) the Hoare annotation is: true [2018-11-23 12:21:31,297 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2018-11-23 12:21:31,297 INFO L448 ceAbstractionStarter]: For program point ceil_doubleFINAL(lines 19 81) no Hoare annotation was computed. [2018-11-23 12:21:31,297 INFO L448 ceAbstractionStarter]: For program point ceil_doubleEXIT(lines 19 81) no Hoare annotation was computed. [2018-11-23 12:21:31,297 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 50) no Hoare annotation was computed. [2018-11-23 12:21:31,298 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2018-11-23 12:21:31,298 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 27) the Hoare annotation is: (or (not (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_ceil~0)) (= |ceil_double_#in~x| ceil_double_~x)) [2018-11-23 12:21:31,298 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2018-11-23 12:21:31,298 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 73) no Hoare annotation was computed. [2018-11-23 12:21:31,298 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 38) no Hoare annotation was computed. [2018-11-23 12:21:31,298 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 12:21:31,298 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_ceil~0) [2018-11-23 12:21:31,298 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 12:21:31,299 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 12:21:31,299 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-23 12:21:31,299 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 98) no Hoare annotation was computed. [2018-11-23 12:21:31,299 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 83 100) the Hoare annotation is: true [2018-11-23 12:21:31,299 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 83 100) no Hoare annotation was computed. [2018-11-23 12:21:31,299 INFO L444 ceAbstractionStarter]: At program point L92(line 92) the Hoare annotation is: (or (not (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_ceil~0)) (= (_ +zero 11 53) main_~x~0)) [2018-11-23 12:21:31,299 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 96) no Hoare annotation was computed. [2018-11-23 12:21:31,299 INFO L448 ceAbstractionStarter]: For program point L92-1(line 92) no Hoare annotation was computed. [2018-11-23 12:21:31,299 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 83 100) no Hoare annotation was computed. [2018-11-23 12:21:31,305 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 12:21:31,308 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 12:21:31,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:21:31 BoogieIcfgContainer [2018-11-23 12:21:31,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:21:31,310 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:21:31,310 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:21:31,310 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:21:31,310 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:14" (3/4) ... [2018-11-23 12:21:31,312 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 12:21:31,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 12:21:31,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ceil_double [2018-11-23 12:21:31,317 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 12:21:31,321 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-23 12:21:31,322 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 12:21:31,322 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 12:21:31,341 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E300) == huge_ceil) || \old(x) == x [2018-11-23 12:21:31,358 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_101f8eb0-9b64-4818-b225-b5ce7fa6c512/bin-2019/uautomizer/witness.graphml [2018-11-23 12:21:31,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:21:31,359 INFO L168 Benchmark]: Toolchain (without parser) took 18398.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 949.7 MB in the beginning and 800.3 MB in the end (delta: 149.5 MB). Peak memory consumption was 264.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:31,359 INFO L168 Benchmark]: CDTParser took 0.15 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 12:21:31,360 INFO L168 Benchmark]: CACSL2BoogieTranslator took 179.92 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 12:21:31,360 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.72 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:21:31,360 INFO L168 Benchmark]: Boogie Preprocessor took 28.25 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 12:21:31,362 INFO L168 Benchmark]: RCFGBuilder took 1262.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -142.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:31,363 INFO L168 Benchmark]: TraceAbstraction took 16859.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 807.0 MB in the end (delta: 269.4 MB). Peak memory consumption was 269.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:31,363 INFO L168 Benchmark]: Witness Printer took 48.42 ms. Allocated memory is still 1.1 GB. Free memory was 807.0 MB in the beginning and 800.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:21:31,365 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.15 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 179.92 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 15.72 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.25 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1262.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -142.8 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16859.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 807.0 MB in the end (delta: 269.4 MB). Peak memory consumption was 269.4 MB. Max. memory is 11.5 GB. * Witness Printer took 48.42 ms. Allocated memory is still 1.1 GB. Free memory was 807.0 MB in the beginning and 800.3 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 96]: 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: 22]: Loop Invariant [2018-11-23 12:21:31,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 12:21:31,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E300) == huge_ceil) || \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 42 locations, 1 error locations. SAFE Result, 16.8s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 247 SDtfs, 230 SDslu, 548 SDs, 0 SdLazy, 329 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred 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, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 8 NumberOfFragments, 29 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 34 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 142 ConstructedInterpolants, 26 QuantifiedInterpolants, 23208 SizeOfPredicates, 23 NumberOfNonLiveVariables, 425 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...