./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_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/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_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/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_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/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_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/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-02 14:30:48,556 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:30:48,557 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:30:48,563 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:30:48,563 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:30:48,563 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:30:48,564 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:30:48,565 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:30:48,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:30:48,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:30:48,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:30:48,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:30:48,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:30:48,567 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:30:48,567 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:30:48,568 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:30:48,568 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:30:48,569 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:30:48,570 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:30:48,571 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:30:48,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:30:48,572 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:30:48,573 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:30:48,573 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:30:48,573 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:30:48,574 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:30:48,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:30:48,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:30:48,575 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:30:48,576 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:30:48,576 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:30:48,576 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:30:48,576 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:30:48,576 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:30:48,577 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:30:48,577 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:30:48,577 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 14:30:48,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:30:48,584 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:30:48,584 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:30:48,584 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:30:48,585 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:30:48,585 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:30:48,585 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 14:30:48,585 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:30:48,585 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:30:48,585 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:30:48,585 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:30:48,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:30:48,586 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:30:48,586 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:30:48,586 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:30:48,586 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:30:48,586 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:30:48,586 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:30:48,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:30:48,587 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:30:48,587 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:30:48,587 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:30:48,587 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:30:48,587 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:30:48,587 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:30:48,588 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:30:48,588 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:30:48,588 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 14:30:48,588 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:30:48,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:30:48,588 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_122bd960-6b95-4aa8-9b14-9d3398008751/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-02 14:30:48,612 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:30:48,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:30:48,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:30:48,625 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:30:48,625 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:30:48,626 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-02 14:30:48,664 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data/c36ed6cd0/5ecfaf61326f4d5783fa576bf2b71fe4/FLAGaa69fb82e [2018-12-02 14:30:49,040 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:30:49,040 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-02 14:30:49,044 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data/c36ed6cd0/5ecfaf61326f4d5783fa576bf2b71fe4/FLAGaa69fb82e [2018-12-02 14:30:49,052 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data/c36ed6cd0/5ecfaf61326f4d5783fa576bf2b71fe4 [2018-12-02 14:30:49,054 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:30:49,055 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:30:49,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:30:49,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:30:49,058 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:30:49,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537737cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49, skipping insertion in model container [2018-12-02 14:30:49,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,065 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:30:49,077 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:30:49,169 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:30:49,172 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:30:49,183 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:30:49,193 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:30:49,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49 WrapperNode [2018-12-02 14:30:49,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:30:49,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:30:49,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:30:49,194 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:30:49,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,207 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:30:49,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:30:49,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:30:49,207 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:30:49,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... [2018-12-02 14:30:49,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:30:49,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:30:49,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:30:49,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:30:49,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/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-02 14:30:49,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:30:49,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:30:49,286 INFO L130 BoogieDeclarations]: Found specification of procedure y [2018-12-02 14:30:49,286 INFO L138 BoogieDeclarations]: Found implementation of procedure y [2018-12-02 14:30:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:30:49,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:30:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:30:49,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:30:49,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 14:30:49,287 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 14:30:49,376 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:30:49,376 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:30:49,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:49 BoogieIcfgContainer [2018-12-02 14:30:49,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:30:49,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:30:49,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:30:49,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:30:49,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:30:49" (1/3) ... [2018-12-02 14:30:49,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3113203a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:30:49, skipping insertion in model container [2018-12-02 14:30:49,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:49" (2/3) ... [2018-12-02 14:30:49,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3113203a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:30:49, skipping insertion in model container [2018-12-02 14:30:49,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:49" (3/3) ... [2018-12-02 14:30:49,381 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-12-02 14:30:49,387 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:30:49,391 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:30:49,401 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:30:49,419 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:30:49,419 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:30:49,420 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:30:49,420 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:30:49,420 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:30:49,420 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:30:49,420 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:30:49,420 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:30:49,420 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:30:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-02 14:30:49,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:30:49,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:30:49,435 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-02 14:30:49,436 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:30:49,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502395, now seen corresponding path program 1 times [2018-12-02 14:30:49,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 14:30:49,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 14:30:49,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:49,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:49,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:30:49,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:30:49,520 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:30:49,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:30:49 BoogieIcfgContainer [2018-12-02 14:30:49,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:30:49,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:30:49,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:30:49,538 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:30:49,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:49" (3/4) ... [2018-12-02 14:30:49,540 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 14:30:49,540 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:30:49,541 INFO L168 Benchmark]: Toolchain (without parser) took 486.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 953.3 MB in the beginning and 1.1 GB in the end (delta: -119.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:30:49,542 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:30:49,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.16 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:30:49,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.32 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:30:49,543 INFO L168 Benchmark]: Boogie Preprocessor took 45.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-12-02 14:30:49,543 INFO L168 Benchmark]: RCFGBuilder took 123.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 14:30:49,543 INFO L168 Benchmark]: TraceAbstraction took 160.32 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:30:49,544 INFO L168 Benchmark]: Witness Printer took 2.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:30:49,546 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.16 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -163.4 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 123.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 160.32 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 2.72 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 6]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 44, overapproximation of to_real at line 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 39. Possible FailurePath: [L10] static NUM yn = 0; [L12] NUM ui = 0; VAL [\old(ui)=9, \old(yn)=4] [L22] NUM yi, yc; [L23] NUM K; [L24] NUM T; [L25] NUM taui; [L26] NUM taud; [L27] NUM ei, sumej, epi; [L28] int i; [L29] T = 1 [L30] taui = 1 [L31] taud = 1 [L32] K = .5 [L33] yc = .5 VAL [\old(ui)=2, \old(yn)=8, K=1/2, ui=2, yc=1/2, yn=8] [L34] CALL, EXPR y(0) VAL [\old(i)=0, \old(ui)=2, \old(yn)=8, ui=2, yn=8] [L16] yn += ui [L17] return yn; VAL [\old(i)=0, \old(ui)=2, \old(yn)=8, \result=6, i=0, ui=2, yn=6] [L34] RET, EXPR y(0) VAL [\old(ui)=2, \old(yn)=8, K=1/2, ui=2, y(0)=6, yc=1/2, yn=6] [L34] yi = y(0) [L35] epi = yc-yi [L36] sumej = epi [L37] i=0 VAL [\old(ui)=2, \old(yn)=8, epi=7, i=0, K=1/2, sumej=7, ui=2, yc=1/2, yi=6, yn=6] [L37] COND TRUE i<120 VAL [\old(ui)=2, \old(yn)=8, epi=7, i=0, K=1/2, sumej=7, ui=2, yc=1/2, yi=6, yn=6] [L38] CALL, EXPR y(i) VAL [\old(i)=0, \old(ui)=2, \old(yn)=6, ui=2, yn=6] [L16] yn += ui [L17] return yn; VAL [\old(i)=0, \old(ui)=2, \old(yn)=6, \result=3, i=0, ui=2, yn=3] [L38] RET, EXPR y(i) VAL [\old(ui)=2, \old(yn)=8, epi=7, i=0, K=1/2, sumej=7, ui=2, y(i)=3, yc=1/2, yi=6, yn=3] [L38] yi = y(i) [L39] ei = yc-yi [L40] sumej = sumej+ei [L41] ui = K*(ei+sumej*T/taui+taud/T*(ei-epi)) [L42] epi = ei VAL [\old(ui)=2, \old(yn)=8, ei=5, epi=5, i=0, K=1/2, yc=1/2, yi=3, yn=3] [L44] CALL __VERIFIER_assert(epi >= -1. && epi <= 1.) VAL [\old(cond)=0, \old(ui)=2, \old(yn)=8, yn=3] [L6] COND TRUE !(cond) VAL [\old(cond)=0, \old(ui)=2, \old(yn)=8, cond=0, yn=3] [L6] __VERIFIER_error() VAL [\old(cond)=0, \old(ui)=2, \old(yn)=8, cond=0, yn=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:30:50,890 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:30:50,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:30:50,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:30:50,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:30:50,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:30:50,898 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:30:50,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:30:50,900 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:30:50,900 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:30:50,901 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:30:50,901 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:30:50,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:30:50,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:30:50,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:30:50,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:30:50,903 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:30:50,904 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:30:50,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:30:50,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:30:50,906 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:30:50,907 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:30:50,908 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:30:50,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:30:50,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:30:50,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:30:50,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:30:50,910 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:30:50,910 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:30:50,911 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:30:50,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:30:50,912 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:30:50,912 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:30:50,912 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:30:50,913 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:30:50,913 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:30:50,913 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-02 14:30:50,923 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:30:50,923 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:30:50,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:30:50,924 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:30:50,924 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 14:30:50,924 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 14:30:50,924 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 14:30:50,925 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:30:50,925 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:30:50,925 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:30:50,925 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:30:50,925 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:30:50,925 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:30:50,925 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:30:50,926 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 14:30:50,926 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 14:30:50,926 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:30:50,926 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:30:50,926 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 14:30:50,926 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:30:50,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:30:50,926 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:30:50,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:30:50,927 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:30:50,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:30:50,927 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:30:50,927 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:30:50,927 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:30:50,927 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-02 14:30:50,928 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:30:50,928 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 14:30:50,928 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 14:30:50,928 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_122bd960-6b95-4aa8-9b14-9d3398008751/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-02 14:30:50,953 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:30:50,962 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:30:50,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:30:50,966 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:30:50,967 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:30:50,967 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-02 14:30:51,011 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data/d98cf4be0/a841c7cccf4c49608b2b1b53647c61f4/FLAGade7d3573 [2018-12-02 14:30:51,405 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:30:51,406 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/sv-benchmarks/c/float-benchs/water_pid_true-unreach-call_true-termination.c [2018-12-02 14:30:51,409 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data/d98cf4be0/a841c7cccf4c49608b2b1b53647c61f4/FLAGade7d3573 [2018-12-02 14:30:51,417 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/bin-2019/uautomizer/data/d98cf4be0/a841c7cccf4c49608b2b1b53647c61f4 [2018-12-02 14:30:51,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:30:51,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:30:51,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:30:51,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:30:51,422 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:30:51,423 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1e8136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51, skipping insertion in model container [2018-12-02 14:30:51,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:30:51,438 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:30:51,528 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:30:51,532 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:30:51,544 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:30:51,552 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:30:51,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51 WrapperNode [2018-12-02 14:30:51,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:30:51,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:30:51,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:30:51,553 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:30:51,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,563 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:30:51,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:30:51,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:30:51,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:30:51,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,574 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,582 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... [2018-12-02 14:30:51,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:30:51,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:30:51,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:30:51,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:30:51,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/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-02 14:30:51,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:30:51,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:30:51,647 INFO L130 BoogieDeclarations]: Found specification of procedure y [2018-12-02 14:30:51,647 INFO L138 BoogieDeclarations]: Found implementation of procedure y [2018-12-02 14:30:51,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:30:51,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:30:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:30:51,648 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:30:51,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-02 14:30:51,648 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-02 14:30:54,520 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:30:54,520 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:30:54,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:54 BoogieIcfgContainer [2018-12-02 14:30:54,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:30:54,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:30:54,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:30:54,524 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:30:54,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:30:51" (1/3) ... [2018-12-02 14:30:54,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ff0fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:30:54, skipping insertion in model container [2018-12-02 14:30:54,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:30:51" (2/3) ... [2018-12-02 14:30:54,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ff0fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:30:54, skipping insertion in model container [2018-12-02 14:30:54,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:30:54" (3/3) ... [2018-12-02 14:30:54,527 INFO L112 eAbstractionObserver]: Analyzing ICFG water_pid_true-unreach-call_true-termination.c [2018-12-02 14:30:54,533 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:30:54,537 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 14:30:54,545 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 14:30:54,563 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 14:30:54,564 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:30:54,564 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:30:54,564 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:30:54,564 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:30:54,564 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:30:54,564 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:30:54,564 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:30:54,564 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:30:54,574 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-12-02 14:30:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:30:54,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:30:54,578 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-02 14:30:54,579 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:30:54,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:30:54,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1227502395, now seen corresponding path program 1 times [2018-12-02 14:30:54,584 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 14:30:54,584 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/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-02 14:30:54,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:30:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:30:57,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:30:57,887 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-02 14:30:58,345 WARN L180 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 14:30:58,904 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-02 14:30:58,904 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 14:30:58,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:30:58,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 14:30:58,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:30:58,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:30:58,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:30:58,952 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 11 states. [2018-12-02 14:30:59,143 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-12-02 14:30:59,292 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-12-02 14:30:59,560 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-02 14:30:59,916 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17 [2018-12-02 14:31:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:31:07,974 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-12-02 14:31:07,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:31:07,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-12-02 14:31:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:31:07,983 INFO L225 Difference]: With dead ends: 69 [2018-12-02 14:31:07,983 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 14:31:07,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:31:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 14:31:08,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-12-02 14:31:08,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 14:31:08,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-02 14:31:08,016 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 21 [2018-12-02 14:31:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:31:08,016 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-02 14:31:08,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:31:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-02 14:31:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 14:31:08,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:31:08,018 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-02 14:31:08,018 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:31:08,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:31:08,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1115695378, now seen corresponding path program 1 times [2018-12-02 14:31:08,019 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-02 14:31:08,019 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_122bd960-6b95-4aa8-9b14-9d3398008751/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-02 14:31:08,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:31:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:31:13,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:31:13,818 WARN L180 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 14:31:15,073 WARN L180 SmtUtils]: Spent 888.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-12-02 14:31:36,382 WARN L180 SmtUtils]: Spent 8.41 s on a formula simplification that was a NOOP. DAG size: 27 [2018-12-02 14:31:38,472 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-02 14:31:40,578 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-02 14:31:42,770 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-02 14:31:48,686 WARN L180 SmtUtils]: Spent 617.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 14:31:50,833 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-02 14:31:58,608 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-02 14:31:58,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:32:12,515 WARN L180 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-02 14:32:13,080 WARN L180 SmtUtils]: Spent 563.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-02 14:32:13,516 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-02 14:32:14,687 WARN L180 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 14:32:15,203 WARN L180 SmtUtils]: Spent 515.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 14:32:42,093 WARN L180 SmtUtils]: Spent 3.47 s on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 14:32:44,151 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-02 14:32:46,215 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-02 14:32:49,004 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-02 14:32:51,812 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-02 14:32:52,248 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-02 14:32:53,081 WARN L180 SmtUtils]: Spent 832.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-02 14:32:53,822 WARN L180 SmtUtils]: Spent 740.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 14:32:54,581 WARN L180 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 14:32:57,419 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-02 14:33:00,245 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-02 14:33:03,617 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-02 14:33:06,944 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-02 14:33:09,735 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-02 14:33:12,524 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-02 14:33:13,055 WARN L180 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-02 14:33:13,662 WARN L180 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-02 14:33:14,489 WARN L180 SmtUtils]: Spent 825.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-02 14:33:15,179 WARN L180 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-02 14:33:17,980 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-02 14:33:20,789 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-02 14:33:24,182 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-02 14:33:26,345 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 14:33:26,547 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2018-12-02 14:33:26,548 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-02 14:33:26,552 INFO L168 Benchmark]: Toolchain (without parser) took 155133.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 944.7 MB in the beginning and 906.2 MB in the end (delta: 38.5 MB). Peak memory consumption was 173.2 MB. Max. memory is 11.5 GB. [2018-12-02 14:33:26,553 INFO L168 Benchmark]: CDTParser took 0.17 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-02 14:33:26,554 INFO L168 Benchmark]: CACSL2BoogieTranslator took 132.79 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:33:26,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.82 ms. Allocated memory is still 1.0 GB. Free memory is still 934.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:33:26,554 INFO L168 Benchmark]: Boogie Preprocessor took 17.15 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 14:33:26,555 INFO L168 Benchmark]: RCFGBuilder took 2936.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-02 14:33:26,555 INFO L168 Benchmark]: TraceAbstraction took 152030.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 906.2 MB in the end (delta: 196.7 MB). Peak memory consumption was 196.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:33:26,558 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.17 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 132.79 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.82 ms. Allocated memory is still 1.0 GB. Free memory is still 934.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.15 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2936.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 152030.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 906.2 MB in the end (delta: 196.7 MB). Peak memory consumption was 196.7 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...