./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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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-635dfa2 [2018-12-09 09:19:05,159 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:19:05,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:19:05,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:19:05,169 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:19:05,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:19:05,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:19:05,171 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:19:05,172 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:19:05,173 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:19:05,174 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:19:05,174 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:19:05,175 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:19:05,175 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:19:05,176 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:19:05,177 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:19:05,177 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:19:05,178 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:19:05,180 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:19:05,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:19:05,182 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:19:05,183 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:19:05,184 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:19:05,184 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:19:05,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:19:05,185 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:19:05,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:19:05,187 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:19:05,187 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:19:05,188 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:19:05,188 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:19:05,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:19:05,189 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:19:05,189 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:19:05,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:19:05,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:19:05,190 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 09:19:05,198 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:19:05,198 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:19:05,199 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:19:05,199 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:19:05,199 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:19:05,199 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:19:05,199 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:19:05,199 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:19:05,199 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:19:05,200 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:19:05,200 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:19:05,201 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:19:05,201 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:19:05,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:19:05,201 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:19:05,201 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:19:05,201 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:19:05,201 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 09:19:05,201 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:19:05,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 09:19:05,201 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_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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-12-09 09:19:05,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:19:05,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:19:05,226 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:19:05,227 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:19:05,227 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:19:05,228 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-09 09:19:05,263 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data/281fc2aa0/85e3a145e37344fe80614db28ba2d8e9/FLAGba8d88a49 [2018-12-09 09:19:05,604 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:19:05,605 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-09 09:19:05,609 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data/281fc2aa0/85e3a145e37344fe80614db28ba2d8e9/FLAGba8d88a49 [2018-12-09 09:19:05,617 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data/281fc2aa0/85e3a145e37344fe80614db28ba2d8e9 [2018-12-09 09:19:05,619 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:19:05,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:19:05,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:19:05,620 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:19:05,622 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:19:05,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c0120e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05, skipping insertion in model container [2018-12-09 09:19:05,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,628 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:19:05,637 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:19:05,726 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:19:05,729 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:19:05,740 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:19:05,748 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:19:05,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05 WrapperNode [2018-12-09 09:19:05,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:19:05,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:19:05,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:19:05,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:19:05,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:19:05,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:19:05,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:19:05,762 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:19:05,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... [2018-12-09 09:19:05,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:19:05,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:19:05,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:19:05,802 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:19:05,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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-12-09 09:19:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:19:05,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:19:05,834 INFO L130 BoogieDeclarations]: Found specification of procedure y [2018-12-09 09:19:05,835 INFO L138 BoogieDeclarations]: Found implementation of procedure y [2018-12-09 09:19:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:19:05,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:19:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:19:05,835 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:19:05,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 09:19:05,835 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 09:19:05,922 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:19:05,922 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 09:19:05,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:19:05 BoogieIcfgContainer [2018-12-09 09:19:05,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:19:05,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:19:05,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:19:05,925 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:19:05,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:19:05" (1/3) ... [2018-12-09 09:19:05,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a50bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:19:05, skipping insertion in model container [2018-12-09 09:19:05,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:05" (2/3) ... [2018-12-09 09:19:05,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a50bfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:19:05, skipping insertion in model container [2018-12-09 09:19:05,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:19:05" (3/3) ... [2018-12-09 09:19:05,927 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-12-09 09:19:05,933 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:19:05,938 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 09:19:05,948 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 09:19:05,966 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:19:05,966 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:19:05,966 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:19:05,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:19:05,967 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:19:05,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:19:05,967 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:19:05,967 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:19:05,967 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:19:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-09 09:19:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 09:19:05,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:19:05,982 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-12-09 09:19:05,983 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:19:05,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:19:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502395, now seen corresponding path program 1 times [2018-12-09 09:19:05,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 09:19:05,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 09:19:06,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:19:06,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:19:06,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 09:19:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:19:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 09:19:06,076 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 09:19:06,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 09:19:06 BoogieIcfgContainer [2018-12-09 09:19:06,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 09:19:06,097 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 09:19:06,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 09:19:06,097 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 09:19:06,098 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:19:05" (3/4) ... [2018-12-09 09:19:06,100 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 09:19:06,100 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 09:19:06,100 INFO L168 Benchmark]: Toolchain (without parser) took 481.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.0 MB). Free memory was 959.8 MB in the beginning and 1.0 GB in the end (delta: -73.1 MB). Peak memory consumption was 2.9 MB. Max. memory is 11.5 GB. [2018-12-09 09:19:06,101 INFO L168 Benchmark]: CDTParser took 0.10 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-12-09 09:19:06,102 INFO L168 Benchmark]: CACSL2BoogieTranslator took 128.49 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:19:06,102 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.97 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:19:06,102 INFO L168 Benchmark]: Boogie Preprocessor took 40.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.0 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -119.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:19:06,103 INFO L168 Benchmark]: RCFGBuilder took 120.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: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. [2018-12-09 09:19:06,103 INFO L168 Benchmark]: TraceAbstraction took 174.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:19:06,103 INFO L168 Benchmark]: Witness Printer took 2.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:19:06,105 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 128.49 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.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 12.97 ms. Allocated memory is still 1.0 GB. Free memory is still 949.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 76.0 MB). Free memory was 949.0 MB in the beginning and 1.1 GB in the end (delta: -119.1 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 120.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: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 174.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 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-635dfa2 [2018-12-09 09:19:07,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 09:19:07,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 09:19:07,472 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 09:19:07,472 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 09:19:07,473 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 09:19:07,474 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 09:19:07,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 09:19:07,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 09:19:07,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 09:19:07,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 09:19:07,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 09:19:07,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 09:19:07,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 09:19:07,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 09:19:07,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 09:19:07,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 09:19:07,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 09:19:07,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 09:19:07,481 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 09:19:07,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 09:19:07,482 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 09:19:07,484 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 09:19:07,484 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 09:19:07,484 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 09:19:07,485 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 09:19:07,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 09:19:07,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 09:19:07,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 09:19:07,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 09:19:07,487 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 09:19:07,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 09:19:07,487 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 09:19:07,487 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 09:19:07,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 09:19:07,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 09:19:07,488 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-09 09:19:07,496 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 09:19:07,496 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 09:19:07,496 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 09:19:07,496 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 09:19:07,497 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 09:19:07,497 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 09:19:07,497 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 09:19:07,497 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 09:19:07,497 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 09:19:07,498 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 09:19:07,498 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 09:19:07,498 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 09:19:07,498 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 09:19:07,498 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 09:19:07,498 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 09:19:07,498 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 09:19:07,498 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 09:19:07,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 09:19:07,499 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 09:19:07,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 09:19:07,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 09:19:07,499 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 09:19:07,499 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 09:19:07,499 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 09:19:07,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 09:19:07,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 09:19:07,500 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 09:19:07,500 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 09:19:07,500 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-09 09:19:07,500 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 09:19:07,500 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 09:19:07,500 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 09:19:07,501 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_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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-12-09 09:19:07,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 09:19:07,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 09:19:07,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 09:19:07,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 09:19:07,529 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 09:19:07,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-09 09:19:07,564 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data/994676068/eb69d84370b340e198ecf99724f438c6/FLAGd13ee31d0 [2018-12-09 09:19:07,903 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 09:19:07,903 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-09 09:19:07,907 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data/994676068/eb69d84370b340e198ecf99724f438c6/FLAGd13ee31d0 [2018-12-09 09:19:08,289 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/bin-2019/uautomizer/data/994676068/eb69d84370b340e198ecf99724f438c6 [2018-12-09 09:19:08,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 09:19:08,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 09:19:08,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 09:19:08,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 09:19:08,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 09:19:08,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267733d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08, skipping insertion in model container [2018-12-09 09:19:08,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 09:19:08,310 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 09:19:08,397 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:19:08,400 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 09:19:08,412 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 09:19:08,420 INFO L195 MainTranslator]: Completed translation [2018-12-09 09:19:08,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08 WrapperNode [2018-12-09 09:19:08,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 09:19:08,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 09:19:08,421 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 09:19:08,421 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 09:19:08,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 09:19:08,435 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 09:19:08,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 09:19:08,435 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 09:19:08,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,448 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... [2018-12-09 09:19:08,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 09:19:08,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 09:19:08,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 09:19:08,451 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 09:19:08,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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-12-09 09:19:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 09:19:08,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 09:19:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure y [2018-12-09 09:19:08,507 INFO L138 BoogieDeclarations]: Found implementation of procedure y [2018-12-09 09:19:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 09:19:08,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 09:19:08,507 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 09:19:08,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 09:19:08,508 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-09 09:19:08,508 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-09 09:19:11,366 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 09:19:11,366 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 09:19:11,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:19:11 BoogieIcfgContainer [2018-12-09 09:19:11,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 09:19:11,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 09:19:11,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 09:19:11,369 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 09:19:11,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 09:19:08" (1/3) ... [2018-12-09 09:19:11,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616788f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:19:11, skipping insertion in model container [2018-12-09 09:19:11,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 09:19:08" (2/3) ... [2018-12-09 09:19:11,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616788f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 09:19:11, skipping insertion in model container [2018-12-09 09:19:11,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 09:19:11" (3/3) ... [2018-12-09 09:19:11,372 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-12-09 09:19:11,380 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 09:19:11,384 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 09:19:11,393 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 09:19:11,411 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 09:19:11,411 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 09:19:11,412 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 09:19:11,412 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 09:19:11,412 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 09:19:11,412 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 09:19:11,412 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 09:19:11,412 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 09:19:11,412 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 09:19:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-09 09:19:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 09:19:11,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:19:11,425 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-12-09 09:19:11,426 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:19:11,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:19:11,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502395, now seen corresponding path program 1 times [2018-12-09 09:19:11,432 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 09:19:11,432 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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-12-09 09:19:11,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:19:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:19:14,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:19:14,722 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-09 09:19:15,164 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 09:19:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 09:19:15,754 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 09:19:15,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 09:19:15,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 09:19:15,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 09:19:15,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 09:19:15,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-09 09:19:15,800 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 11 states. [2018-12-09 09:19:15,994 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-09 09:19:16,160 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-12-09 09:19:16,450 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-09 09:19:16,827 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-12-09 09:19:25,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 09:19:25,302 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-12-09 09:19:25,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 09:19:25,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-12-09 09:19:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 09:19:25,311 INFO L225 Difference]: With dead ends: 69 [2018-12-09 09:19:25,311 INFO L226 Difference]: Without dead ends: 37 [2018-12-09 09:19:25,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-09 09:19:25,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-09 09:19:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-09 09:19:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 09:19:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-09 09:19:25,342 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 21 [2018-12-09 09:19:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 09:19:25,342 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-09 09:19:25,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 09:19:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-09 09:19:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 09:19:25,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 09:19:25,344 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-12-09 09:19:25,344 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 09:19:25,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 09:19:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1115695378, now seen corresponding path program 1 times [2018-12-09 09:19:25,345 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-09 09:19:25,345 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_18875b26-2a5b-4fb7-af50-44d8fd4e81e6/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-12-09 09:19:25,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 09:19:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 09:19:30,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 09:19:31,046 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 09:19:32,057 WARN L180 SmtUtils]: Spent 697.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-09 09:19:53,324 WARN L180 SmtUtils]: Spent 8.41 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-09 09:19:55,416 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-12-09 09:19:57,529 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-12-09 09:19:59,653 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-12-09 09:20:05,613 WARN L180 SmtUtils]: Spent 636.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-09 09:20:07,702 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-12-09 09:20:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 3 trivial. 5 not checked. [2018-12-09 09:20:15,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 09:20:29,014 WARN L180 SmtUtils]: Spent 812.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-09 09:20:29,414 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-09 09:20:29,703 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-09 09:20:31,018 WARN L180 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 09:20:33,262 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 13 [2018-12-09 09:21:00,885 WARN L180 SmtUtils]: Spent 5.09 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-09 09:21:02,941 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-12-09 09:21:05,001 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-12-09 09:21:07,837 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-12-09 09:21:10,678 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-12-09 09:21:11,128 WARN L180 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-09 09:21:11,689 WARN L180 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-09 09:21:12,303 WARN L180 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 09:21:13,130 WARN L180 SmtUtils]: Spent 825.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-09 09:21:15,960 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-12-09 09:21:18,790 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-12-09 09:21:22,187 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-12-09 09:21:25,521 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-12-09 09:21:28,323 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-12-09 09:21:31,131 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-12-09 09:21:31,757 WARN L180 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-09 09:21:32,672 WARN L180 SmtUtils]: Spent 914.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-09 09:21:33,313 WARN L180 SmtUtils]: Spent 640.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-09 09:21:34,327 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 13 [2018-12-09 09:21:37,130 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-12-09 09:21:39,950 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-12-09 09:21:43,367 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-12-09 09:21:45,215 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-09 09:21:45,417 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2018-12-09 09:21:45,418 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-12-09 09:21:45,423 INFO L168 Benchmark]: Toolchain (without parser) took 157132.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 942.0 MB in the beginning and 898.4 MB in the end (delta: 43.7 MB). Peak memory consumption was 167.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:21:45,425 INFO L168 Benchmark]: CDTParser took 0.12 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-12-09 09:21:45,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.27 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:21:45,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.54 ms. Allocated memory is still 1.0 GB. Free memory is still 931.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 09:21:45,426 INFO L168 Benchmark]: Boogie Preprocessor took 15.44 ms. Allocated memory is still 1.0 GB. Free memory was 931.3 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:21:45,426 INFO L168 Benchmark]: RCFGBuilder took 2915.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-09 09:21:45,427 INFO L168 Benchmark]: TraceAbstraction took 154055.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 898.4 MB in the end (delta: 199.4 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. [2018-12-09 09:21:45,429 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.12 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 129.27 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.3 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 13.54 ms. Allocated memory is still 1.0 GB. Free memory is still 931.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.44 ms. Allocated memory is still 1.0 GB. Free memory was 931.3 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2915.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 154055.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 898.4 MB in the end (delta: 199.4 MB). Peak memory consumption was 199.4 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...