./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/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 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 .................................................................................................................................................................................................................................................................................... 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_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/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 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 .................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 12:36:57,007 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:36:57,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:36:57,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:36:57,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:36:57,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:36:57,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:36:57,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:36:57,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:36:57,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:36:57,020 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:36:57,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:36:57,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:36:57,021 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:36:57,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:36:57,023 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:36:57,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:36:57,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:36:57,026 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:36:57,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:36:57,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:36:57,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:36:57,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:36:57,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:36:57,030 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:36:57,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:36:57,031 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:36:57,032 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:36:57,032 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:36:57,033 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:36:57,033 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:36:57,034 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:36:57,034 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:36:57,034 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:36:57,035 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:36:57,035 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:36:57,035 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 12:36:57,044 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:36:57,045 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:36:57,045 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:36:57,045 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:36:57,046 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:36:57,046 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:36:57,046 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:36:57,046 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:36:57,046 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:36:57,047 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 12:36:57,047 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:36:57,047 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:36:57,047 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:36:57,047 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:36:57,047 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:36:57,047 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:36:57,047 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:36:57,048 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:36:57,048 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:36:57,048 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:36:57,048 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:36:57,048 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:36:57,048 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:36:57,048 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:36:57,049 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:36:57,049 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:36:57,049 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:36:57,049 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 12:36:57,049 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:36:57,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 12:36:57,049 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_e906ddaf-f91e-4702-9d04-c7857585c2ad/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 -> 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 [2018-11-28 12:36:57,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:36:57,085 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:36:57,087 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:36:57,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:36:57,088 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:36:57,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-11-28 12:36:57,123 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data/4e794d1b9/828e9c4145e84724b9938e0eceb2534e/FLAG6188d373b [2018-11-28 12:36:57,531 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:36:57,532 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-11-28 12:36:57,536 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data/4e794d1b9/828e9c4145e84724b9938e0eceb2534e/FLAG6188d373b [2018-11-28 12:36:57,544 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data/4e794d1b9/828e9c4145e84724b9938e0eceb2534e [2018-11-28 12:36:57,546 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:36:57,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:36:57,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:36:57,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:36:57,549 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:36:57,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c1b638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57, skipping insertion in model container [2018-11-28 12:36:57,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:36:57,568 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:36:57,666 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:36:57,669 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:36:57,680 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:36:57,690 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:36:57,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57 WrapperNode [2018-11-28 12:36:57,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:36:57,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:36:57,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:36:57,691 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:36:57,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:36:57,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:36:57,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:36:57,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:36:57,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,718 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,728 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... [2018-11-28 12:36:57,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:36:57,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:36:57,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:36:57,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:36:57,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/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-28 12:36:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:36:57,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:36:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure y [2018-11-28 12:36:57,804 INFO L138 BoogieDeclarations]: Found implementation of procedure y [2018-11-28 12:36:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:36:57,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:36:57,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:36:57,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:36:57,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 12:36:57,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 12:36:57,919 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:36:57,919 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:36:57,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:36:57 BoogieIcfgContainer [2018-11-28 12:36:57,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:36:57,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:36:57,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:36:57,922 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:36:57,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:36:57" (1/3) ... [2018-11-28 12:36:57,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f71caa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:36:57, skipping insertion in model container [2018-11-28 12:36:57,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:36:57" (2/3) ... [2018-11-28 12:36:57,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f71caa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:36:57, skipping insertion in model container [2018-11-28 12:36:57,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:36:57" (3/3) ... [2018-11-28 12:36:57,925 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-11-28 12:36:57,931 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:36:57,936 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:36:57,949 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:36:57,974 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:36:57,975 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:36:57,975 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:36:57,975 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:36:57,975 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:36:57,975 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:36:57,976 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:36:57,976 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:36:57,976 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:36:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-28 12:36:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:36:57,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:36:57,993 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:36:57,994 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:36:57,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:36:57,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502395, now seen corresponding path program 1 times [2018-11-28 12:36:57,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 12:36:57,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 12:36:58,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:58,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:36:58,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 12:36:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:36:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 12:36:58,100 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 12:36:58,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:36:58 BoogieIcfgContainer [2018-11-28 12:36:58,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 12:36:58,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 12:36:58,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 12:36:58,124 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 12:36:58,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:36:57" (3/4) ... [2018-11-28 12:36:58,127 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 12:36:58,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 12:36:58,128 INFO L168 Benchmark]: Toolchain (without parser) took 582.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 957.6 MB in the beginning and 1.1 GB in the end (delta: -121.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:36:58,130 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:36:58,130 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:36:58,131 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.77 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:36:58,131 INFO L168 Benchmark]: Boogie Preprocessor took 20.13 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:36:58,132 INFO L168 Benchmark]: RCFGBuilder took 189.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 12:36:58,132 INFO L168 Benchmark]: TraceAbstraction took 203.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 12:36:58,133 INFO L168 Benchmark]: Witness Printer took 3.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:36:58,136 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.60 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.77 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.13 ms. Allocated memory is still 1.0 GB. Free memory was 946.9 MB in the beginning and 944.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 189.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 203.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.88 ms. Allocated memory is still 1.1 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: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of to_real at line 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L10] static NUM yn = 0; [L12] NUM ui = 0; VAL [\old(ui)=9, \old(yn)=4] [L22] NUM yi, yc; [L23] NUM K; [L24] NUM T; [L25] NUM taui; [L26] NUM taud; [L27] NUM ei, sumej, epi; [L28] int i; [L29] T = 1 [L30] taui = 1 [L31] taud = 1 [L32] K = .5 [L33] yc = .5 VAL [\old(ui)=2, \old(yn)=8, K=1/2, ui=2, yc=1/2, yn=8] [L34] CALL, EXPR y(0) VAL [\old(i)=0, \old(ui)=2, \old(yn)=8, ui=2, yn=8] [L16] yn += ui [L17] return yn; VAL [\old(i)=0, \old(ui)=2, \old(yn)=8, \result=6, i=0, ui=2, yn=6] [L34] RET, EXPR y(0) VAL [\old(ui)=2, \old(yn)=8, K=1/2, ui=2, y(0)=6, yc=1/2, yn=6] [L34] yi = y(0) [L35] epi = yc-yi [L36] sumej = epi [L37] i=0 VAL [\old(ui)=2, \old(yn)=8, epi=7, i=0, K=1/2, sumej=7, ui=2, yc=1/2, yi=6, yn=6] [L37] COND TRUE i<120 VAL [\old(ui)=2, \old(yn)=8, epi=7, i=0, K=1/2, sumej=7, ui=2, yc=1/2, yi=6, yn=6] [L38] CALL, EXPR y(i) VAL [\old(i)=0, \old(ui)=2, \old(yn)=6, ui=2, yn=6] [L16] yn += ui [L17] return yn; VAL [\old(i)=0, \old(ui)=2, \old(yn)=6, \result=3, i=0, ui=2, yn=3] [L38] RET, EXPR y(i) VAL [\old(ui)=2, \old(yn)=8, epi=7, i=0, K=1/2, sumej=7, ui=2, y(i)=3, yc=1/2, yi=6, yn=3] [L38] yi = y(i) [L39] ei = yc-yi [L40] sumej = sumej+ei [L41] ui = K*(ei+sumej*T/taui+taud/T*(ei-epi)) [L42] epi = ei VAL [\old(ui)=2, \old(yn)=8, ei=5, epi=5, i=0, K=1/2, yc=1/2, yi=3, yn=3] [L44] CALL __VERIFIER_assert(epi >= -1. && epi <= 1.) VAL [\old(cond)=0, \old(ui)=2, \old(yn)=8, yn=3] [L6] COND TRUE !(cond) VAL [\old(cond)=0, \old(ui)=2, \old(yn)=8, cond=0, yn=3] [L6] __VERIFIER_error() VAL [\old(cond)=0, \old(ui)=2, \old(yn)=8, cond=0, yn=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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-0cd3be1 [2018-11-28 12:36:59,569 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 12:36:59,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 12:36:59,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 12:36:59,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 12:36:59,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 12:36:59,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 12:36:59,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 12:36:59,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 12:36:59,583 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 12:36:59,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 12:36:59,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 12:36:59,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 12:36:59,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 12:36:59,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 12:36:59,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 12:36:59,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 12:36:59,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 12:36:59,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 12:36:59,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 12:36:59,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 12:36:59,591 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 12:36:59,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 12:36:59,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 12:36:59,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 12:36:59,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 12:36:59,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 12:36:59,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 12:36:59,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 12:36:59,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 12:36:59,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 12:36:59,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 12:36:59,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 12:36:59,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 12:36:59,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 12:36:59,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 12:36:59,598 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-28 12:36:59,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 12:36:59,609 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 12:36:59,610 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 12:36:59,610 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 12:36:59,611 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 12:36:59,611 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 12:36:59,611 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 12:36:59,611 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 12:36:59,611 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 12:36:59,611 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 12:36:59,611 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 12:36:59,612 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 12:36:59,612 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 12:36:59,612 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 12:36:59,612 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 12:36:59,612 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 12:36:59,612 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 12:36:59,613 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 12:36:59,613 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 12:36:59,613 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 12:36:59,613 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 12:36:59,613 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 12:36:59,615 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 12:36:59,615 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 12:36:59,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 12:36:59,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 12:36:59,616 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 12:36:59,616 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 12:36:59,616 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 12:36:59,616 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 12:36:59,616 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 12:36:59,616 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 12:36:59,616 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_e906ddaf-f91e-4702-9d04-c7857585c2ad/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 -> 7fd08b3e226d625ffd75458b50e3f94c29ac1e83 [2018-11-28 12:36:59,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 12:36:59,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 12:36:59,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 12:36:59,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 12:36:59,657 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 12:36:59,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-11-28 12:36:59,705 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data/0762769bb/df28ca4b3e0745c7a5b5eace0316f656/FLAG9311fb37d [2018-11-28 12:37:00,101 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 12:37:00,101 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-11-28 12:37:00,105 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data/0762769bb/df28ca4b3e0745c7a5b5eace0316f656/FLAG9311fb37d [2018-11-28 12:37:00,113 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/bin-2019/uautomizer/data/0762769bb/df28ca4b3e0745c7a5b5eace0316f656 [2018-11-28 12:37:00,115 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 12:37:00,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 12:37:00,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 12:37:00,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 12:37:00,120 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 12:37:00,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b15b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00, skipping insertion in model container [2018-11-28 12:37:00,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,129 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 12:37:00,142 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 12:37:00,251 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:37:00,256 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 12:37:00,272 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 12:37:00,282 INFO L195 MainTranslator]: Completed translation [2018-11-28 12:37:00,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00 WrapperNode [2018-11-28 12:37:00,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 12:37:00,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 12:37:00,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 12:37:00,284 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 12:37:00,290 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 12:37:00,302 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 12:37:00,302 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 12:37:00,303 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 12:37:00,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... [2018-11-28 12:37:00,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 12:37:00,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 12:37:00,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 12:37:00,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 12:37:00,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/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-28 12:37:00,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 12:37:00,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 12:37:00,399 INFO L130 BoogieDeclarations]: Found specification of procedure y [2018-11-28 12:37:00,399 INFO L138 BoogieDeclarations]: Found implementation of procedure y [2018-11-28 12:37:00,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 12:37:00,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 12:37:00,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 12:37:00,400 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 12:37:00,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 12:37:00,400 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 12:37:03,289 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 12:37:03,289 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 12:37:03,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:37:03 BoogieIcfgContainer [2018-11-28 12:37:03,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 12:37:03,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 12:37:03,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 12:37:03,293 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 12:37:03,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:37:00" (1/3) ... [2018-11-28 12:37:03,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1bb119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:37:03, skipping insertion in model container [2018-11-28 12:37:03,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:37:00" (2/3) ... [2018-11-28 12:37:03,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1bb119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:37:03, skipping insertion in model container [2018-11-28 12:37:03,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:37:03" (3/3) ... [2018-11-28 12:37:03,296 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-11-28 12:37:03,306 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 12:37:03,312 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 12:37:03,323 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 12:37:03,344 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 12:37:03,344 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 12:37:03,344 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 12:37:03,344 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 12:37:03,345 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 12:37:03,345 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 12:37:03,345 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 12:37:03,345 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 12:37:03,345 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 12:37:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-28 12:37:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 12:37:03,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:37:03,359 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:37:03,361 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:37:03,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:37:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502395, now seen corresponding path program 1 times [2018-11-28 12:37:03,366 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 12:37:03,367 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/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-28 12:37:03,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:37:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:37:06,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:37:06,909 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 12:37:07,233 WARN L180 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 12:37:07,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 12:37:07,952 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 12:37:07,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 12:37:07,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 12:37:08,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 12:37:08,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 12:37:08,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-28 12:37:08,010 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 11 states. [2018-11-28 12:37:08,456 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-28 12:37:08,689 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-28 12:37:09,023 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-11-28 12:37:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 12:37:17,236 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-28 12:37:17,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 12:37:17,238 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-11-28 12:37:17,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 12:37:17,247 INFO L225 Difference]: With dead ends: 69 [2018-11-28 12:37:17,248 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 12:37:17,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-11-28 12:37:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 12:37:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-28 12:37:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 12:37:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-28 12:37:17,283 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 21 [2018-11-28 12:37:17,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 12:37:17,283 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-28 12:37:17,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 12:37:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-28 12:37:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 12:37:17,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 12:37:17,286 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 12:37:17,286 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 12:37:17,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 12:37:17,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1115695378, now seen corresponding path program 1 times [2018-11-28 12:37:17,287 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 12:37:17,287 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e906ddaf-f91e-4702-9d04-c7857585c2ad/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-28 12:37:17,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 12:37:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 12:37:23,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 12:37:23,388 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 12:37:24,247 WARN L180 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 12:37:45,437 WARN L180 SmtUtils]: Spent 8.39 s on a formula simplification that was a NOOP. DAG size: 27 [2018-11-28 12:37:47,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (and (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (fp.mul roundNearestTiesToEven .cse0 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))) (.cse1 (fp.sub roundNearestTiesToEven .cse0 c_~yn~0)) (.cse2 (fp.sub roundNearestTiesToEven .cse0 .cse4))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse1) .cse3) .cse3)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven .cse3 .cse3) (fp.sub roundNearestTiesToEven .cse1 .cse2)))))) c_~ui~0) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse4 .cse5))))) is different from true [2018-11-28 12:37:49,657 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.div roundNearestTiesToEven .cse3 .cse3)) (.cse5 (fp.add roundNearestTiesToEven .cse6 .cse6))) (and (= (fp.mul roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven .cse0 c_~yn~0)) (.cse2 (fp.sub roundNearestTiesToEven .cse0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse1) .cse3) .cse3)) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse1 .cse2))))) c_~ui~0) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse5 .cse6)) (= c_main_~yc~0 .cse0) (= c_~ui~0 (fp.mul roundNearestTiesToEven .cse0 (let ((.cse7 (fp.sub roundNearestTiesToEven c_main_~yc~0 c_~yn~0)) (.cse8 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse8 .cse7) .cse3) .cse3)) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse7 .cse8))))))))) is different from false [2018-11-28 12:37:51,930 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse4 (fp.div roundNearestTiesToEven .cse3 .cse3)) (.cse5 (fp.add roundNearestTiesToEven .cse6 .cse6))) (and (= (fp.mul roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven .cse0 c_~yn~0)) (.cse2 (fp.sub roundNearestTiesToEven .cse0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse1) .cse3) .cse3)) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse1 .cse2))))) c_~ui~0) (= c_~yn~0 (fp.add roundNearestTiesToEven .cse5 .cse6)) (= c_main_~yc~0 .cse0) (= c_~ui~0 (fp.mul roundNearestTiesToEven .cse0 (let ((.cse7 (fp.sub roundNearestTiesToEven c_main_~yc~0 c_~yn~0)) (.cse8 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse8 .cse7) .cse3) .cse3)) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse7 .cse8))))))))) is different from true [2018-11-28 12:37:58,216 WARN L180 SmtUtils]: Spent 733.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 12:38:00,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse6 (fp.add roundNearestTiesToEven .cse10 .cse10)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse4 .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0))) (.cse7 (fp.add roundNearestTiesToEven .cse6 .cse10))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse8 (fp.sub roundNearestTiesToEven .cse1 .cse7)) (.cse9 (fp.sub roundNearestTiesToEven .cse1 .cse6))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse9 .cse8) .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse8 .cse9))))))) (and (= .cse0 (fp.mul roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse7)) (.cse3 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse6))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse2) .cse4) .cse4)) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse2 .cse3)))))) (= c_main_~yc~0 .cse1) (= |c_main_#t~ret2| (fp.add roundNearestTiesToEven .cse7 .cse0))))))) is different from true [2018-11-28 12:38:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 3 trivial. 5 not checked. [2018-11-28 12:38:07,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 12:38:23,605 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 12:38:24,136 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 12:38:24,595 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 12:38:26,601 WARN L180 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 12:38:28,159 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 12:38:57,022 WARN L180 SmtUtils]: Spent 6.06 s on a formula simplification that was a NOOP. DAG size: 12 [2018-11-28 12:38:59,084 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.sub roundNearestTiesToEven v_prenex_1 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (.cse2 (fp.neg .cse1))) (or (not (fp.leq .cse0 .cse1)) (not (fp.geq .cse0 .cse2)) (fp.geq (fp.sub roundNearestTiesToEven v_prenex_1 |c_y_#res|) .cse2))))) (forall ((v_main_~yc~0_BEFORE_CALL_7 (_ FloatingPoint 11 53))) (let ((.cse4 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_7 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.leq (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_7 |c_y_#res|) .cse3) (not (fp.geq .cse4 (fp.neg .cse3))) (not (fp.leq .cse4 .cse3)))))) is different from true [2018-11-28 12:39:01,148 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_main_~yc~0_BEFORE_CALL_7 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_7 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.leq (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_7 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0)) .cse0) (not (fp.geq .cse1 (fp.neg .cse0))) (not (fp.leq .cse1 .cse0))))) (forall ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.sub roundNearestTiesToEven v_prenex_1 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (.cse4 (fp.neg .cse3))) (or (not (fp.leq .cse2 .cse3)) (not (fp.geq .cse2 .cse4)) (fp.geq (fp.sub roundNearestTiesToEven v_prenex_1 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0)) .cse4)))))) is different from true [2018-11-28 12:39:03,961 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_main_~yc~0 |c_main_#t~ret2|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~sumej~0 .cse2) c_main_~T~0) c_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~taud~0 c_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-11-28 12:39:06,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_main_~yc~0 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven c_main_~K~0 (let ((.cse2 (fp.sub roundNearestTiesToEven c_main_~yc~0 |c_main_#t~ret2|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~sumej~0 .cse2) c_main_~T~0) c_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~taud~0 c_main_~T~0) (fp.sub roundNearestTiesToEven .cse2 c_main_~epi~0)))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-11-28 12:39:07,516 WARN L180 SmtUtils]: Spent 726.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 12:39:08,137 WARN L180 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 12:39:08,878 WARN L180 SmtUtils]: Spent 740.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 12:39:10,173 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 12:39:12,994 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~sumej~0 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~taud~0 c_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2018-11-28 12:39:15,814 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse2))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~sumej~0 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~taud~0 c_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 c_main_~epi~0))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2018-11-28 12:39:19,213 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.div roundNearestTiesToEven v_prenex_3 v_prenex_7))) (let ((.cse3 (fp.sub roundNearestTiesToEven v_prenex_8 (let ((.cse4 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven v_prenex_4 (let ((.cse5 (fp.sub roundNearestTiesToEven v_prenex_8 .cse4))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_6 .cse5) v_prenex_7) v_prenex_5)) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse5 v_prenex_2))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.leq (fp.sub roundNearestTiesToEven v_prenex_8 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven v_prenex_4 (let ((.cse0 (fp.sub roundNearestTiesToEven v_prenex_8 |c_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_6 .cse0) v_prenex_7) v_prenex_5)) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven .cse0 v_prenex_2))))))) .cse2) (not (fp.leq .cse3 .cse2)) (not (fp.geq .cse3 (fp.neg .cse2))))))) (forall ((v_main_~epi~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taud~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~sumej~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_9 (_ FloatingPoint 11 53))) (let ((.cse9 (fp.div roundNearestTiesToEven v_main_~taud~0_BEFORE_CALL_3 v_main_~T~0_BEFORE_CALL_3)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 (fp.neg .cse10)) (.cse6 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_9 (let ((.cse11 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (fp.add roundNearestTiesToEven .cse11 (fp.mul roundNearestTiesToEven v_main_~K~0_BEFORE_CALL_3 (let ((.cse12 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_9 .cse11))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~sumej~0_BEFORE_CALL_2 .cse12) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse12 v_main_~epi~0_BEFORE_CALL_4)))))))))) (or (not (fp.geq .cse6 .cse7)) (fp.geq (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_9 (fp.add roundNearestTiesToEven c_~yn~0 (fp.mul roundNearestTiesToEven v_main_~K~0_BEFORE_CALL_3 (let ((.cse8 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_9 |c_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~sumej~0_BEFORE_CALL_2 .cse8) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse8 v_main_~epi~0_BEFORE_CALL_4))))))) .cse7) (not (fp.leq .cse6 .cse10))))))) is different from true [2018-11-28 12:39:22,544 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div roundNearestTiesToEven v_prenex_3 v_prenex_7))) (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_8 (let ((.cse5 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (fp.add roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven v_prenex_4 (let ((.cse6 (fp.sub roundNearestTiesToEven v_prenex_8 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_6 .cse6) v_prenex_7) v_prenex_5)) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse6 v_prenex_2))))))))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.leq (fp.sub roundNearestTiesToEven v_prenex_8 (let ((.cse0 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven v_prenex_4 (let ((.cse1 (fp.sub roundNearestTiesToEven v_prenex_8 .cse0))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_6 .cse1) v_prenex_7) v_prenex_5)) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse1 v_prenex_2)))))))) .cse3) (not (fp.leq .cse4 .cse3)) (not (fp.geq .cse4 (fp.neg .cse3))))))) (forall ((v_main_~epi~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taud~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~sumej~0_BEFORE_CALL_2 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_3 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_9 (_ FloatingPoint 11 53))) (let ((.cse11 (fp.div roundNearestTiesToEven v_main_~taud~0_BEFORE_CALL_3 v_main_~T~0_BEFORE_CALL_3)) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.neg .cse12)) (.cse7 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_9 (let ((.cse13 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (fp.add roundNearestTiesToEven .cse13 (fp.mul roundNearestTiesToEven v_main_~K~0_BEFORE_CALL_3 (let ((.cse14 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_9 .cse13))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~sumej~0_BEFORE_CALL_2 .cse14) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul roundNearestTiesToEven .cse11 (fp.sub roundNearestTiesToEven .cse14 v_main_~epi~0_BEFORE_CALL_4)))))))))) (or (not (fp.geq .cse7 .cse8)) (fp.geq (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_9 (let ((.cse9 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse9 (fp.mul roundNearestTiesToEven v_main_~K~0_BEFORE_CALL_3 (let ((.cse10 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_9 .cse9))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven v_main_~sumej~0_BEFORE_CALL_2 .cse10) v_main_~T~0_BEFORE_CALL_3) v_main_~taui~0_BEFORE_CALL_3)) (fp.mul roundNearestTiesToEven .cse11 (fp.sub roundNearestTiesToEven .cse10 v_main_~epi~0_BEFORE_CALL_4)))))))) .cse8) (not (fp.leq .cse7 .cse12))))))) is different from true [2018-11-28 12:39:25,349 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse2)) (.cse4 (fp.sub roundNearestTiesToEven c_main_~yc~0 |c_main_#t~ret0|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~taud~0 c_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 .cse4))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-11-28 12:39:28,165 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_main_~yc~0 (let ((.cse2 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse2)) (.cse4 (fp.sub roundNearestTiesToEven c_main_~yc~0 |c_main_#t~ret0|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~taud~0 c_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 .cse4))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-11-28 12:39:28,655 WARN L180 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 12:39:29,330 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 12:39:29,990 WARN L180 SmtUtils]: Spent 658.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 12:39:31,518 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification that was a NOOP. DAG size: 13 [2018-11-28 12:39:34,315 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse5 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse2)) (.cse4 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~taud~0 c_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 .cse4)))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2018-11-28 12:39:37,134 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub roundNearestTiesToEven c_main_~yc~0 (let ((.cse5 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (let ((.cse2 (fp.add roundNearestTiesToEven .cse5 c_~ui~0))) (fp.add roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_main_~K~0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse2)) (.cse4 (fp.sub roundNearestTiesToEven c_main_~yc~0 .cse5))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse3) c_main_~T~0) c_main_~taui~0)) (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven c_main_~taud~0 c_main_~T~0) (fp.sub roundNearestTiesToEven .cse3 .cse4)))))))))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2018-11-28 12:39:40,508 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_main_~taud~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~yc~0_BEFORE_CALL_10 (_ FloatingPoint 11 53)) (v_main_~T~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~taui~0_BEFORE_CALL_4 (_ FloatingPoint 11 53)) (v_main_~K~0_BEFORE_CALL_4 (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven v_main_~taud~0_BEFORE_CALL_4 v_main_~T~0_BEFORE_CALL_4))) (let ((.cse5 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_10 (let ((.cse9 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (let ((.cse6 (fp.add roundNearestTiesToEven .cse9 c_~ui~0))) (fp.add roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven v_main_~K~0_BEFORE_CALL_4 (let ((.cse7 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_10 .cse6)) (.cse8 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_10 .cse9))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse8 .cse7) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse7 .cse8)))))))))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.leq (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_10 (let ((.cse0 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven v_main_~K~0_BEFORE_CALL_4 (let ((.cse1 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_10 .cse0)) (.cse2 (fp.sub roundNearestTiesToEven v_main_~yc~0_BEFORE_CALL_10 |c_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse2 .cse1) v_main_~T~0_BEFORE_CALL_4) v_main_~taui~0_BEFORE_CALL_4)) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse1 .cse2)))))))) .cse4) (not (fp.leq .cse5 .cse4)) (not (fp.geq .cse5 (fp.neg .cse4))))))) (forall ((v_prenex_12 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse16 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse13 (fp.div roundNearestTiesToEven v_prenex_9 v_prenex_11))) (let ((.cse15 (fp.sub roundNearestTiesToEven v_prenex_10 (let ((.cse20 (fp.add roundNearestTiesToEven |c_old(~yn~0)| c_~ui~0))) (let ((.cse17 (fp.add roundNearestTiesToEven .cse20 c_~ui~0))) (fp.add roundNearestTiesToEven .cse17 (fp.mul roundNearestTiesToEven v_prenex_13 (let ((.cse18 (fp.sub roundNearestTiesToEven v_prenex_10 .cse17)) (.cse19 (fp.sub roundNearestTiesToEven v_prenex_10 .cse20))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse18 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse19 .cse18) v_prenex_11) v_prenex_12)) (fp.mul roundNearestTiesToEven .cse13 (fp.sub roundNearestTiesToEven .cse18 .cse19)))))))))) (.cse14 (fp.neg .cse16))) (or (fp.geq (fp.sub roundNearestTiesToEven v_prenex_10 (let ((.cse10 (fp.add roundNearestTiesToEven c_~yn~0 c_~ui~0))) (fp.add roundNearestTiesToEven .cse10 (fp.mul roundNearestTiesToEven v_prenex_13 (let ((.cse11 (fp.sub roundNearestTiesToEven v_prenex_10 .cse10)) (.cse12 (fp.sub roundNearestTiesToEven v_prenex_10 |c_y_#res|))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse12 .cse11) v_prenex_11) v_prenex_12)) (fp.mul roundNearestTiesToEven .cse13 (fp.sub roundNearestTiesToEven .cse11 .cse12)))))))) .cse14) (not (fp.leq .cse15 .cse16)) (not (fp.geq .cse15 .cse14))))))) is different from true [2018-11-28 12:39:42,293 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-28 12:39:42,494 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2018-11-28 12:39:42,494 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-28 12:39:42,497 INFO L168 Benchmark]: Toolchain (without parser) took 162380.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 944.7 MB in the beginning and 936.9 MB in the end (delta: 7.9 MB). Peak memory consumption was 168.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:39:42,497 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:39:42,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.02 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 12:39:42,498 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.50 ms. Allocated memory is still 1.0 GB. Free memory is still 934.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 12:39:42,499 INFO L168 Benchmark]: Boogie Preprocessor took 17.39 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 12:39:42,499 INFO L168 Benchmark]: RCFGBuilder took 2969.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-28 12:39:42,499 INFO L168 Benchmark]: TraceAbstraction took 159205.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 936.9 MB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 11.5 GB. [2018-11-28 12:39:42,502 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 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.02 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.50 ms. Allocated memory is still 1.0 GB. Free memory is still 934.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.39 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2969.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 159205.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 936.9 MB in the end (delta: 193.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...