./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1052d_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_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1052d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 204277589f1e9105606b7fb7cfd8af760c5fd585 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1052d_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 204277589f1e9105606b7fb7cfd8af760c5fd585 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:58:18,809 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:58:18,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:58:18,817 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:58:18,817 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:58:18,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:58:18,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:58:18,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:58:18,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:58:18,821 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:58:18,822 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:58:18,822 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:58:18,823 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:58:18,824 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:58:18,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:58:18,825 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:58:18,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:58:18,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:58:18,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:58:18,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:58:18,829 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:58:18,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:58:18,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:58:18,832 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:58:18,832 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:58:18,833 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:58:18,833 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:58:18,834 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:58:18,835 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:58:18,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:58:18,836 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:58:18,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:58:18,836 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:58:18,836 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:58:18,837 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:58:18,838 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:58:18,838 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 14:58:18,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:58:18,848 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:58:18,848 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:58:18,848 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:58:18,849 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:58:18,849 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:58:18,849 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:58:18,849 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:58:18,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:58:18,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:58:18,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:58:18,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:58:18,850 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:58:18,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:58:18,850 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:58:18,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:58:18,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:58:18,851 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:58:18,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:58:18,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:58:18,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:58:18,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:58:18,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:58:18,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:58:18,852 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:58:18,852 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:58:18,852 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:58:18,852 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 14:58:18,852 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:58:18,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:58:18,852 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_c9a6903b-488d-49e9-94cf-886ced3513d9/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 -> 204277589f1e9105606b7fb7cfd8af760c5fd585 [2018-11-23 14:58:18,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:58:18,885 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:58:18,888 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:58:18,889 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:58:18,889 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:58:18,889 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1052d_true-unreach-call.c [2018-11-23 14:58:18,933 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data/69465116a/e17e1eeaeb6e44eaabf2c19842d394bf/FLAG14d4f6f19 [2018-11-23 14:58:19,346 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:58:19,346 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/sv-benchmarks/c/float-newlib/double_req_bl_1052d_true-unreach-call.c [2018-11-23 14:58:19,351 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data/69465116a/e17e1eeaeb6e44eaabf2c19842d394bf/FLAG14d4f6f19 [2018-11-23 14:58:19,361 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data/69465116a/e17e1eeaeb6e44eaabf2c19842d394bf [2018-11-23 14:58:19,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:58:19,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:58:19,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:58:19,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:58:19,367 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:58:19,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@287c3841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19, skipping insertion in model container [2018-11-23 14:58:19,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:58:19,391 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:58:19,513 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:58:19,515 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:58:19,536 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:58:19,588 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:58:19,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19 WrapperNode [2018-11-23 14:58:19,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:58:19,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:58:19,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:58:19,589 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:58:19,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:58:19,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:58:19,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:58:19,607 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:58:19,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,615 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... [2018-11-23 14:58:19,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:58:19,628 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:58:19,628 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:58:19,628 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:58:19,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 14:58:19,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 14:58:19,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:58:19,660 INFO L130 BoogieDeclarations]: Found specification of procedure floor_double [2018-11-23 14:58:19,660 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_double [2018-11-23 14:58:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:58:19,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:58:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 14:58:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:58:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 14:58:19,661 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 14:58:19,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:58:19,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:58:19,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:58:19,662 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:58:19,662 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:58:19,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:58:19,864 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:58:19,865 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 14:58:19,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:19 BoogieIcfgContainer [2018-11-23 14:58:19,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:58:19,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:58:19,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:58:19,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:58:19,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:58:19" (1/3) ... [2018-11-23 14:58:19,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ba4fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:58:19, skipping insertion in model container [2018-11-23 14:58:19,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:19" (2/3) ... [2018-11-23 14:58:19,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ba4fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:58:19, skipping insertion in model container [2018-11-23 14:58:19,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:19" (3/3) ... [2018-11-23 14:58:19,871 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052d_true-unreach-call.c [2018-11-23 14:58:19,879 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:58:19,885 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:58:19,898 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:58:19,919 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:58:19,919 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:58:19,919 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:58:19,920 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:58:19,920 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:58:19,920 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:58:19,920 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:58:19,920 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:58:19,920 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:58:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-23 14:58:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:58:19,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:19,937 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 14:58:19,939 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:19,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:19,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1202696015, now seen corresponding path program 1 times [2018-11-23 14:58:19,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:58:19,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:58:19,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:58:19,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:19,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:58:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:20,028 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 14:58:20,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:20,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:58:20,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:58:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:58:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:58:20,041 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-23 14:58:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:20,062 INFO L93 Difference]: Finished difference Result 94 states and 139 transitions. [2018-11-23 14:58:20,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:58:20,063 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 14:58:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:20,071 INFO L225 Difference]: With dead ends: 94 [2018-11-23 14:58:20,071 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 14:58:20,074 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 14:58:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 14:58:20,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 14:58:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 14:58:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2018-11-23 14:58:20,106 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2018-11-23 14:58:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:20,106 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2018-11-23 14:58:20,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:58:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2018-11-23 14:58:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:58:20,107 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:20,108 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] [2018-11-23 14:58:20,108 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:20,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1688222156, now seen corresponding path program 1 times [2018-11-23 14:58:20,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 14:58:20,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 14:58:20,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:58:20,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:58:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:58:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:58:20,178 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=15, |#NULL.offset|=9, |old(#NULL.base)|=15, |old(#NULL.offset)|=9, |old(~huge_floor~0)|=12.0, ~huge_floor~0=12.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_floor~0 := 1.0E300; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9, |old(~huge_floor~0)|=12.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=15, |old(#NULL.offset)|=9, |old(~huge_floor~0)|=12.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #148#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret11 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x~0 := 0.0; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call #t~ret8 := floor_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~i0~0;havoc ~i1~0;havoc ~j0~0;havoc ~i~0;havoc ~j~0; VAL [floor_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=0.0, ~huge_floor~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~mem0;havoc #t~union1;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~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [floor_double_~i0~0=3, floor_double_~i1~0=1, floor_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] goto; VAL [floor_double_~i0~0=3, floor_double_~i1~0=1, floor_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [floor_double_~i0~0=3, floor_double_~i1~0=1, floor_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume ~j0~0 < 20; VAL [floor_double_~i0~0=3, floor_double_~i1~0=1, floor_double_~j0~0=0, floor_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !(~j0~0 < 0);~i~0 := ~shiftRight(1048575, ~j0~0); VAL [floor_double_~i0~0=3, floor_double_~i1~0=1, floor_double_~j0~0=0, floor_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296;#res := ~x; VAL [floor_double_~i0~0=3, floor_double_~i1~0=1, floor_double_~j0~0=0, floor_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=0.0, |floor_double_#res|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume true; VAL [floor_double_~i0~0=3, floor_double_~i1~0=1, floor_double_~j0~0=0, floor_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |floor_double_#in~x|=0.0, |floor_double_#res|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] RET #152#return; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0.0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] ~res~0 := #t~ret8;havoc #t~ret8;#t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short10|=false, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !#t~short10; VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short10|=false, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !#t~short10;havoc #t~ret9;havoc #t~short10; VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=0.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_floor~0=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=12.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L98] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] CALL call #t~ret8 := floor_double(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~x=0.0] [L20] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~mem0; [L22] havoc #t~union1; [L23] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L20] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L26-L69] assume ~j0~0 < 20; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L27-L46] assume !(~j0~0 < 0); [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L38-L39] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L39] #res := ~x; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L16-L77] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L99] RET call #t~ret8 := floor_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0.0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] ~res~0 := #t~ret8; [L99] havoc #t~ret8; [L102] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] assume !#t~short10; VAL [#NULL.base=0, #NULL.offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102-L105] assume !#t~short10; [L102] havoc #t~ret9; [L102] havoc #t~short10; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L103] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~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=15, #NULL.offset=9, old(#NULL.base)=15, old(#NULL.offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=12.0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=1.0E300] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=15, old(#NULL.offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret11 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L98] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] CALL call #t~ret8 := floor_double(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~x=0.0] [L20] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L21] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L22] havoc #t~mem0; [L22] havoc #t~union1; [L23] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L20] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L26-L69] assume ~j0~0 < 20; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L27-L46] assume !(~j0~0 < 0); [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L38-L39] assume 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296; [L39] #res := ~x; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L16-L77] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0.0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L99] RET call #t~ret8 := floor_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0.0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] ~res~0 := #t~ret8; [L99] havoc #t~ret8; [L102] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] assume !#t~short10; VAL [#NULL.base=0, #NULL.offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102-L105] assume !#t~short10; [L102] havoc #t~ret9; [L102] havoc #t~short10; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L103] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=12.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L98] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] CALL call #t~ret8 := floor_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=0.0] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem0; [L22] havoc #t~union1; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L27] COND FALSE !(~j0~0 < 0) [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L38] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L39] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L99] RET call #t~ret8 := floor_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0.0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] ~res~0 := #t~ret8; [L99] havoc #t~ret8; [L102] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] COND TRUE !#t~short10 [L102] havoc #t~ret9; [L102] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L103] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~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=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=12.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L98] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] CALL call #t~ret8 := floor_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=0.0] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem0; [L22] havoc #t~union1; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L27] COND FALSE !(~j0~0 < 0) [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L38] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L39] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L99] RET call #t~ret8 := floor_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0.0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] ~res~0 := #t~ret8; [L99] havoc #t~ret8; [L102] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] COND TRUE !#t~short10 [L102] havoc #t~ret9; [L102] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L103] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=12.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L98] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] CALL call #t~ret8 := floor_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=0.0] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem0; [L22] havoc #t~union1; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L27] COND FALSE !(~j0~0 < 0) [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L38] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L39] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L99] RET call #t~ret8 := floor_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0.0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] ~res~0 := #t~ret8; [L99] havoc #t~ret8; [L102] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] COND TRUE !#t~short10 [L102] havoc #t~ret9; [L102] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L103] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~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=15, #NULL!offset=9, old(#NULL!base)=15, old(#NULL!offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=12.0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L14] ~huge_floor~0 := 1.0E300; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=15, old(#NULL!offset)=9, old(~huge_floor~0)=12.0, ~huge_floor~0=1.0E300] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [?] CALL call #t~ret11 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L98] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] CALL call #t~ret8 := floor_double(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300] [L16-L77] ~x := #in~x; [L17] havoc ~i0~0; [L17] havoc ~i1~0; [L17] havoc ~j0~0; [L18] havoc ~i~0; [L18] havoc ~j~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~x=0.0] [L20] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L21] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L22] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L22] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L22] havoc #t~mem0; [L22] havoc #t~union1; [L23] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L23] ~i1~0 := (if #t~mem2 % 4294967296 % 4294967296 <= 2147483647 then #t~mem2 % 4294967296 % 4294967296 else #t~mem2 % 4294967296 % 4294967296 - 4294967296); [L23] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L23] havoc #t~mem2; [L23] havoc #t~union3; [L20] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L20] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L25] ~j0~0 := ~bitwiseAnd(~i0~0 / 1048576, 2047) - 1023; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~x=0.0] [L26] COND TRUE ~j0~0 < 20 VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L27] COND FALSE !(~j0~0 < 0) [L37] ~i~0 := ~shiftRight(1048575, ~j0~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L38] COND TRUE 0 == ~bitwiseOr(~bitwiseAnd(~i0~0, ~i~0), ~i1~0) % 4294967296 [L39] #res := ~x; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0.0, ~huge_floor~0=1.0E300, ~i0~0=3, ~i1~0=1, ~j0~0=0, ~x=0.0] [L99] RET call #t~ret8 := floor_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0.0, ~huge_floor~0=1.0E300, ~x~0=0.0] [L99] ~res~0 := #t~ret8; [L99] havoc #t~ret8; [L102] #t~short10 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] COND FALSE !(#t~short10) VAL [#NULL!base=0, #NULL!offset=0, #t~short10=false, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L102] COND TRUE !#t~short10 [L102] havoc #t~ret9; [L102] havoc #t~short10; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L103] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_floor~0=1.0E300, ~res~0=0.0, ~x~0=0.0] [L14] static const double huge_floor = 1.0e300; VAL [\old(huge_floor)=12, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L98] double x = 0.0; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L99] CALL, EXPR floor_double(x) VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=1, x=0] [L26] COND TRUE j0 < 20 VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=1, j0=0, x=0] [L27] COND FALSE !(j0 < 0) [L37] i = (0x000fffff) >> j0 VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=1, j0=0, x=0] [L38] COND TRUE ((i0 & i) | i1) == 0 [L39] return x; VAL [\old(x)=0, \result=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=1, j0=0, x=0] [L99] RET, EXPR floor_double(x) VAL [floor_double(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L99] double res = floor_double(x); [L102] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, res == 0.0 && __signbit_double(res) == 0=0, x=0] [L102] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L103] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, x=0] ----- [2018-11-23 14:58:20,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:58:20 BoogieIcfgContainer [2018-11-23 14:58:20,223 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:58:20,224 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:58:20,224 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:58:20,224 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:58:20,224 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:19" (3/4) ... [2018-11-23 14:58:20,227 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:58:20,227 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:58:20,228 INFO L168 Benchmark]: Toolchain (without parser) took 864.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 962.5 MB in the beginning and 1.1 GB in the end (delta: -90.2 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:20,229 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:58:20,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 962.5 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:20,231 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.16 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:20,231 INFO L168 Benchmark]: Boogie Preprocessor took 20.39 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 14:58:20,232 INFO L168 Benchmark]: RCFGBuilder took 237.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:20,232 INFO L168 Benchmark]: TraceAbstraction took 357.96 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:20,232 INFO L168 Benchmark]: Witness Printer took 3.78 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 14:58:20,235 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 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 962.5 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.16 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.39 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. * RCFGBuilder took 237.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 357.96 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: 37.2 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.78 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: 103]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of shiftRight at line 37, overapproximation of bitwiseOr at line 38, overapproximation of bitwiseAnd at line 25, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L14] static const double huge_floor = 1.0e300; VAL [\old(huge_floor)=12, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L98] double x = 0.0; VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L99] CALL, EXPR floor_double(x) VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L17] __int32_t i0, i1, j0; [L18] __uint32_t i, j; VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L20] ieee_double_shape_type ew_u; [L21] ew_u.value = (x) [L22] EXPR ew_u.parts.msw [L22] (i0) = ew_u.parts.msw [L23] EXPR ew_u.parts.lsw [L23] (i1) = ew_u.parts.lsw [L25] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=1, x=0] [L26] COND TRUE j0 < 20 VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=1, j0=0, x=0] [L27] COND FALSE !(j0 < 0) [L37] i = (0x000fffff) >> j0 VAL [\old(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=1, j0=0, x=0] [L38] COND TRUE ((i0 & i) | i1) == 0 [L39] return x; VAL [\old(x)=0, \result=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=3, i1=1, j0=0, x=0] [L99] RET, EXPR floor_double(x) VAL [floor_double(x)=0, huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=0] [L99] double res = floor_double(x); [L102] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, res == 0.0 && __signbit_double(res) == 0=0, x=0] [L102] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L103] __VERIFIER_error() VAL [huge_floor=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, res=0, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 51 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 66 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=51occurred 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, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 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 14:58:21,636 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:58:21,637 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:58:21,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:58:21,645 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:58:21,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:58:21,646 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:58:21,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:58:21,648 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:58:21,649 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:58:21,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:58:21,650 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:58:21,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:58:21,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:58:21,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:58:21,652 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:58:21,653 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:58:21,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:58:21,655 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:58:21,656 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:58:21,657 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:58:21,658 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:58:21,659 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:58:21,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:58:21,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:58:21,660 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:58:21,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:58:21,662 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:58:21,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:58:21,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:58:21,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:58:21,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:58:21,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:58:21,664 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:58:21,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:58:21,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:58:21,665 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 14:58:21,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:58:21,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:58:21,677 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:58:21,677 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:58:21,677 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:58:21,677 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:58:21,677 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 14:58:21,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:58:21,678 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:58:21,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:58:21,678 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:58:21,678 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:58:21,678 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:58:21,678 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:58:21,678 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:58:21,679 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:58:21,679 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:58:21,679 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:58:21,679 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:58:21,679 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:58:21,679 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:58:21,679 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:58:21,679 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:58:21,680 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:58:21,680 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:58:21,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:58:21,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:58:21,680 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:58:21,680 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 14:58:21,680 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:58:21,680 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:58:21,681 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 14:58:21,681 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_c9a6903b-488d-49e9-94cf-886ced3513d9/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 -> 204277589f1e9105606b7fb7cfd8af760c5fd585 [2018-11-23 14:58:21,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:58:21,723 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:58:21,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:58:21,727 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:58:21,727 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:58:21,728 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1052d_true-unreach-call.c [2018-11-23 14:58:21,773 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data/384957956/8067a94269a946a186db4bd0a3f9472d/FLAG1d0bc5973 [2018-11-23 14:58:22,109 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:58:22,110 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/sv-benchmarks/c/float-newlib/double_req_bl_1052d_true-unreach-call.c [2018-11-23 14:58:22,114 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data/384957956/8067a94269a946a186db4bd0a3f9472d/FLAG1d0bc5973 [2018-11-23 14:58:22,537 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/data/384957956/8067a94269a946a186db4bd0a3f9472d [2018-11-23 14:58:22,539 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:58:22,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:58:22,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:58:22,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:58:22,542 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:58:22,543 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f9f557f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22, skipping insertion in model container [2018-11-23 14:58:22,545 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,550 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:58:22,565 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:58:22,688 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:58:22,692 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:58:22,715 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:58:22,735 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:58:22,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22 WrapperNode [2018-11-23 14:58:22,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:58:22,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:58:22,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:58:22,736 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:58:22,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:58:22,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:58:22,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:58:22,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:58:22,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... [2018-11-23 14:58:22,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:58:22,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:58:22,833 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:58:22,833 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:58:22,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 14:58:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure floor_double [2018-11-23 14:58:22,869 INFO L138 BoogieDeclarations]: Found implementation of procedure floor_double [2018-11-23 14:58:22,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 14:58:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:58:22,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:58:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:58:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 14:58:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 14:58:22,870 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 14:58:22,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 14:58:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:58:22,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:58:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:58:22,871 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:58:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 14:58:22,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:58:22,987 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:58:23,730 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:58:23,756 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:58:23,756 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 14:58:23,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:23 BoogieIcfgContainer [2018-11-23 14:58:23,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:58:23,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:58:23,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:58:23,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:58:23,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:58:22" (1/3) ... [2018-11-23 14:58:23,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34711722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:58:23, skipping insertion in model container [2018-11-23 14:58:23,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:58:22" (2/3) ... [2018-11-23 14:58:23,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34711722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:58:23, skipping insertion in model container [2018-11-23 14:58:23,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:23" (3/3) ... [2018-11-23 14:58:23,761 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1052d_true-unreach-call.c [2018-11-23 14:58:23,766 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:58:23,771 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:58:23,783 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:58:23,800 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:58:23,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:58:23,801 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:58:23,801 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:58:23,801 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:58:23,801 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:58:23,801 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:58:23,801 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:58:23,801 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:58:23,811 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-23 14:58:23,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 14:58:23,814 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:23,815 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 14:58:23,816 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:23,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1202696015, now seen corresponding path program 1 times [2018-11-23 14:58:23,822 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:58:23,822 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 14:58:23,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:23,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:58:23,883 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 14:58:23,884 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:58:23,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:23,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:58:23,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:58:23,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:58:23,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:58:23,905 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-23 14:58:23,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:23,923 INFO L93 Difference]: Finished difference Result 94 states and 139 transitions. [2018-11-23 14:58:23,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:58:23,924 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 14:58:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:23,933 INFO L225 Difference]: With dead ends: 94 [2018-11-23 14:58:23,933 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 14:58:23,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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 14:58:23,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 14:58:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 14:58:23,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 14:58:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2018-11-23 14:58:23,959 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2018-11-23 14:58:23,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:23,960 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2018-11-23 14:58:23,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:58:23,960 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2018-11-23 14:58:23,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:58:23,961 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:23,961 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] [2018-11-23 14:58:23,961 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:23,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:23,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1688222156, now seen corresponding path program 1 times [2018-11-23 14:58:23,962 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:58:23,962 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 14:58:23,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:24,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:58:24,112 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 14:58:24,112 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:58:24,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:24,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:58:24,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 14:58:24,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:58:24,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:58:24,121 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 7 states. [2018-11-23 14:58:25,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:25,254 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-23 14:58:25,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 14:58:25,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 14:58:25,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:25,257 INFO L225 Difference]: With dead ends: 56 [2018-11-23 14:58:25,258 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 14:58:25,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 14:58:25,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 14:58:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-11-23 14:58:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 14:58:25,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2018-11-23 14:58:25,264 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 20 [2018-11-23 14:58:25,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:25,265 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2018-11-23 14:58:25,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 14:58:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2018-11-23 14:58:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:58:25,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:25,266 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] [2018-11-23 14:58:25,266 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:25,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:25,267 INFO L82 PathProgramCache]: Analyzing trace with hash -747077603, now seen corresponding path program 1 times [2018-11-23 14:58:25,267 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:58:25,267 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 14:58:25,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:25,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:58:25,859 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2018-11-23 14:58:26,093 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 14:58:26,094 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:58:26,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:26,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:58:26,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 14:58:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:58:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:58:26,103 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand 7 states. [2018-11-23 14:58:27,939 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 14:58:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:30,021 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-23 14:58:30,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 14:58:30,022 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 14:58:30,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:30,022 INFO L225 Difference]: With dead ends: 58 [2018-11-23 14:58:30,023 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 14:58:30,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 14:58:30,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 14:58:30,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-23 14:58:30,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 14:58:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2018-11-23 14:58:30,026 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 20 [2018-11-23 14:58:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:30,027 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2018-11-23 14:58:30,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 14:58:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2018-11-23 14:58:30,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 14:58:30,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:30,027 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 14:58:30,027 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:30,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:30,028 INFO L82 PathProgramCache]: Analyzing trace with hash 180598350, now seen corresponding path program 1 times [2018-11-23 14:58:30,028 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:58:30,028 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 14:58:30,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:30,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:58:31,969 WARN L180 SmtUtils]: Spent 816.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-23 14:58:31,973 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 14:58:31,973 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:58:31,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:31,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 14:58:31,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:58:31,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:58:31,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:58:31,982 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand 6 states. [2018-11-23 14:58:34,325 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 14:58:36,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:36,384 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2018-11-23 14:58:36,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 14:58:36,391 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 14:58:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:36,392 INFO L225 Difference]: With dead ends: 69 [2018-11-23 14:58:36,392 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 14:58:36,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:58:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 14:58:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 14:58:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 14:58:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-23 14:58:36,396 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 23 [2018-11-23 14:58:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:36,396 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-23 14:58:36,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:58:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 14:58:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 14:58:36,397 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:36,397 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 14:58:36,397 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:36,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:36,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1037458242, now seen corresponding path program 1 times [2018-11-23 14:58:36,398 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:58:36,398 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 14:58:36,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:36,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:58:36,519 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 14:58:36,527 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 14:58:36,537 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 27 treesize of output 15 [2018-11-23 14:58:36,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:36,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:36,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:36,543 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 14:58:36,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:15 [2018-11-23 14:58:36,579 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 14:58:36,579 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:58:36,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:36,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:58:36,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 14:58:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:58:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:58:36,588 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 7 states. [2018-11-23 14:58:37,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:37,346 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2018-11-23 14:58:37,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 14:58:37,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 14:58:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:37,347 INFO L225 Difference]: With dead ends: 61 [2018-11-23 14:58:37,347 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 14:58:37,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:58:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 14:58:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2018-11-23 14:58:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 14:58:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-23 14:58:37,353 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 24 [2018-11-23 14:58:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:37,354 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-23 14:58:37,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 14:58:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-11-23 14:58:37,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 14:58:37,354 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:37,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:58:37,355 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:37,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:37,355 INFO L82 PathProgramCache]: Analyzing trace with hash -729750026, now seen corresponding path program 1 times [2018-11-23 14:58:37,355 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:58:37,355 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 14:58:37,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:37,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:37,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:58:37,479 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 14:58:37,482 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 14:58:37,488 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 14:58:37,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:37,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:37,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:37,498 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 14:58:37,498 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:25, output treesize:14 [2018-11-23 14:58:37,648 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 14:58:37,652 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 14:58:37,668 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 14:58:37,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:37,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:37,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:37,694 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 14:58:37,694 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:36 [2018-11-23 14:58:37,902 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 14:58:37,902 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:58:37,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:37,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 14:58:37,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 14:58:37,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 14:58:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:58:37,911 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 12 states. [2018-11-23 14:58:40,819 WARN L180 SmtUtils]: Spent 2.49 s on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 14:58:43,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:43,085 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2018-11-23 14:58:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:58:43,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 14:58:43,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:43,086 INFO L225 Difference]: With dead ends: 70 [2018-11-23 14:58:43,086 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 14:58:43,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-11-23 14:58:43,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 14:58:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 54. [2018-11-23 14:58:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 14:58:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-23 14:58:43,090 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 25 [2018-11-23 14:58:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:43,090 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-23 14:58:43,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 14:58:43,090 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-11-23 14:58:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 14:58:43,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:43,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:58:43,091 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:43,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:43,091 INFO L82 PathProgramCache]: Analyzing trace with hash -336723016, now seen corresponding path program 1 times [2018-11-23 14:58:43,092 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:58:43,092 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/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 14:58:43,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:43,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:58:43,223 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:58:43,224 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:58:43,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 14:58:43,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 14:58:43,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:43,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 14:58:43,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-23 14:58:43,272 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:43,273 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:43,278 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 14:58:43,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:58:43,284 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 14:58:43,337 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 14:58:43,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:58:43,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:43,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 14:58:43,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 14:58:43,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 14:58:43,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 14:58:43,346 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 6 states. [2018-11-23 14:58:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:44,703 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2018-11-23 14:58:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:58:44,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 14:58:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:44,704 INFO L225 Difference]: With dead ends: 95 [2018-11-23 14:58:44,704 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 14:58:44,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 14:58:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 14:58:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2018-11-23 14:58:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 14:58:44,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-23 14:58:44,709 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 25 [2018-11-23 14:58:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:44,709 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-23 14:58:44,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 14:58:44,710 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 14:58:44,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 14:58:44,710 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:44,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:58:44,710 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:44,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:44,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1734331853, now seen corresponding path program 1 times [2018-11-23 14:58:44,711 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:58:44,711 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 14:58:44,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:44,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:58:44,842 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:58:44,842 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:58:44,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 14:58:44,873 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:58:44,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 14:58:44,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:44,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 14:58:44,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 14:58:44,901 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:44,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:44,906 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 14:58:44,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:58:44,912 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 14:58:44,993 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 14:58:44,994 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:58:45,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:45,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 14:58:45,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 14:58:45,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 14:58:45,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 14:58:45,003 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 7 states. [2018-11-23 14:58:45,406 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 14:58:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:46,598 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-11-23 14:58:46,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:58:46,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 14:58:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:46,600 INFO L225 Difference]: With dead ends: 70 [2018-11-23 14:58:46,600 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 14:58:46,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-11-23 14:58:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 14:58:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 14:58:46,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 14:58:46,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2018-11-23 14:58:46,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 26 [2018-11-23 14:58:46,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:46,603 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2018-11-23 14:58:46,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 14:58:46,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2018-11-23 14:58:46,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 14:58:46,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:58:46,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:58:46,604 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:58:46,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:58:46,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1407604295, now seen corresponding path program 1 times [2018-11-23 14:58:46,605 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:58:46,605 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 14:58:46,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:58:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:58:46,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:58:46,788 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 14:58:46,791 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 14:58:46,802 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 27 treesize of output 15 [2018-11-23 14:58:46,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:46,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:46,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:46,807 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 14:58:46,808 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:45, output treesize:15 [2018-11-23 14:58:46,860 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:58:46,861 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 14:58:46,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 14:58:46,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-11-23 14:58:46,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:46,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 14:58:46,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 14:58:46,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 14:58:46,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:58:46,928 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 14:58:46,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 14:58:46,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 14:58:47,078 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 14:58:47,078 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:58:47,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:58:47,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 14:58:47,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 14:58:47,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 14:58:47,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:58:47,087 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand 12 states. [2018-11-23 14:58:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:58:47,606 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2018-11-23 14:58:47,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 14:58:47,606 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-23 14:58:47,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:58:47,607 INFO L225 Difference]: With dead ends: 33 [2018-11-23 14:58:47,607 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 14:58:47,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2018-11-23 14:58:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 14:58:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 14:58:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 14:58:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 14:58:47,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-11-23 14:58:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:58:47,608 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:58:47,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 14:58:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:58:47,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 14:58:47,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 14:58:47,802 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 34) no Hoare annotation was computed. [2018-11-23 14:58:47,802 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2018-11-23 14:58:47,802 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 68) no Hoare annotation was computed. [2018-11-23 14:58:47,802 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 24) the Hoare annotation is: (or (= floor_double_~x |floor_double_#in~x|) (not (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))) [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 51) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point floor_doubleFINAL(lines 16 77) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point L40(lines 40 45) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 35) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 66) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 57 66) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point floor_doubleEXIT(lines 16 77) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L451 ceAbstractionStarter]: At program point floor_doubleENTRY(lines 16 77) the Hoare annotation is: true [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 42) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 41 42) no Hoare annotation was computed. [2018-11-23 14:58:47,803 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 75) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 16 77) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L70-2(lines 70 75) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 63) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 34) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L62-2(lines 62 63) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 65) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 55) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 69) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 69) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 79 89) no Hoare annotation was computed. [2018-11-23 14:58:47,804 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 79 89) no Hoare annotation was computed. [2018-11-23 14:58:47,805 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 82 86) no Hoare annotation was computed. [2018-11-23 14:58:47,805 INFO L444 ceAbstractionStarter]: At program point L82-2(lines 82 86) the Hoare annotation is: (or (not (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0)) (= |__signbit_double_#in~x| __signbit_double_~x)) [2018-11-23 14:58:47,805 INFO L448 ceAbstractionStarter]: For program point L82-3(lines 82 86) no Hoare annotation was computed. [2018-11-23 14:58:47,805 INFO L451 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 79 89) the Hoare annotation is: true [2018-11-23 14:58:47,805 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:58:47,805 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0) [2018-11-23 14:58:47,805 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 14:58:47,805 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 14:58:47,805 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 91 108) the Hoare annotation is: true [2018-11-23 14:58:47,805 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 91 108) no Hoare annotation was computed. [2018-11-23 14:58:47,805 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 91 108) no Hoare annotation was computed. [2018-11-23 14:58:47,806 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 103) no Hoare annotation was computed. [2018-11-23 14:58:47,806 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-23 14:58:47,806 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-23 14:58:47,806 INFO L444 ceAbstractionStarter]: At program point L102-1(line 102) the Hoare annotation is: (or (and (= (let ((.cse0 (concat (_ bv0 32) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0) (= (_ +zero 11 53) main_~x~0) |main_#t~short10|) (not (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))) [2018-11-23 14:58:47,806 INFO L448 ceAbstractionStarter]: For program point L102-2(line 102) no Hoare annotation was computed. [2018-11-23 14:58:47,806 INFO L444 ceAbstractionStarter]: At program point L99(line 99) the Hoare annotation is: (or (= (_ +zero 11 53) main_~x~0) (not (= ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0) ~huge_floor~0))) [2018-11-23 14:58:47,806 INFO L448 ceAbstractionStarter]: For program point L99-1(line 99) no Hoare annotation was computed. [2018-11-23 14:58:47,806 INFO L448 ceAbstractionStarter]: For program point L102-4(lines 102 105) no Hoare annotation was computed. [2018-11-23 14:58:47,812 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:58:47,816 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:58:47,816 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:58:47,817 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:58:47,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:58:47 BoogieIcfgContainer [2018-11-23 14:58:47,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:58:47,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:58:47,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:58:47,819 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:58:47,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:58:23" (3/4) ... [2018-11-23 14:58:47,821 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 14:58:47,825 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure floor_double [2018-11-23 14:58:47,825 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 14:58:47,825 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-11-23 14:58:47,825 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 14:58:47,828 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-11-23 14:58:47,828 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 14:58:47,829 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 14:58:47,845 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) || !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E300) == huge_floor) [2018-11-23 14:58:47,845 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E300) == huge_floor) || \old(x) == x [2018-11-23 14:58:47,865 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c9a6903b-488d-49e9-94cf-886ced3513d9/bin-2019/uautomizer/witness.graphml [2018-11-23 14:58:47,865 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:58:47,866 INFO L168 Benchmark]: Toolchain (without parser) took 25326.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 948.6 MB in the beginning and 1.0 GB in the end (delta: -60.5 MB). Peak memory consumption was 131.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:47,867 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:58:47,867 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.92 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:47,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.19 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:58:47,867 INFO L168 Benchmark]: Boogie Preprocessor took 77.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:47,867 INFO L168 Benchmark]: RCFGBuilder took 923.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:47,868 INFO L168 Benchmark]: TraceAbstraction took 24061.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.8 MB). Peak memory consumption was 131.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:47,868 INFO L168 Benchmark]: Witness Printer took 47.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:58:47,870 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.92 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 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 19.19 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -180.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 923.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24061.27 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.8 MB). Peak memory consumption was 131.9 MB. Max. memory is 11.5 GB. * Witness Printer took 47.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 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 - 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: 103]: 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: 82]: Loop Invariant [2018-11-23 14:58:47,873 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:58:47,873 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E300) == huge_floor) || \old(x) == x - InvariantResult [Line: 19]: Loop Invariant [2018-11-23 14:58:47,873 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 14:58:47,874 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == \old(x) || !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E300) == huge_floor) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 51 locations, 1 error locations. SAFE Result, 24.0s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 18.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 404 SDtfs, 408 SDslu, 1430 SDs, 0 SdLazy, 838 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=5, 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, 9 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 18 PreInvPairs, 21 NumberOfFragments, 67 HoareAnnotationTreeSize, 18 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 56 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 205 ConstructedInterpolants, 42 QuantifiedInterpolants, 36767 SizeOfPredicates, 34 NumberOfNonLiveVariables, 602 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...