./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i5_o5_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i5_o5_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/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 bd8a40b9ab0ccbf5be4fcc211d81cb04996473fb .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:03:33,914 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:03:33,915 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:03:33,924 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:03:33,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:03:33,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:03:33,926 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:03:33,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:03:33,928 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:03:33,929 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:03:33,930 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:03:33,930 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:03:33,931 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:03:33,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:03:33,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:03:33,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:03:33,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:03:33,934 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:03:33,936 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:03:33,937 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:03:33,938 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:03:33,939 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:03:33,940 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:03:33,941 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:03:33,941 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:03:33,941 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:03:33,942 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:03:33,943 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:03:33,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:03:33,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:03:33,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:03:33,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:03:33,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:03:33,945 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:03:33,946 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:03:33,946 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:03:33,947 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:03:33,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:03:33,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:03:33,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:03:33,958 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:03:33,959 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:03:33,959 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:03:33,959 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:03:33,959 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:03:33,959 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:03:33,959 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:03:33,960 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:03:33,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:03:33,960 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:03:33,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:03:33,960 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:03:33,960 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:03:33,960 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:03:33,961 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:03:33,961 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:03:33,961 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:03:33,961 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:03:33,961 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:03:33,961 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:03:33,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:03:33,962 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:03:33,962 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:03:33,962 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:03:33,962 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:03:33,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:03:33,962 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:03:33,963 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_afbce5c9-5736-499e-bdc9-8920a0229654/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 -> bd8a40b9ab0ccbf5be4fcc211d81cb04996473fb [2018-11-23 03:03:33,990 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:03:33,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:03:34,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:03:34,003 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:03:34,004 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:03:34,004 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/id_i5_o5_false-unreach-call_true-termination.c [2018-11-23 03:03:34,049 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/data/fb8fd88a2/f05ec284178e451d8a30f1b6394603d0/FLAG8b6c229fc [2018-11-23 03:03:34,374 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:03:34,375 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/sv-benchmarks/c/recursive-simple/id_i5_o5_false-unreach-call_true-termination.c [2018-11-23 03:03:34,379 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/data/fb8fd88a2/f05ec284178e451d8a30f1b6394603d0/FLAG8b6c229fc [2018-11-23 03:03:34,811 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/data/fb8fd88a2/f05ec284178e451d8a30f1b6394603d0 [2018-11-23 03:03:34,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:03:34,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:03:34,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:03:34,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:03:34,819 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:03:34,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:34,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46704e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34, skipping insertion in model container [2018-11-23 03:03:34,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:34,829 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:03:34,841 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:03:34,965 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:03:34,967 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:03:34,976 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:03:34,984 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:03:34,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34 WrapperNode [2018-11-23 03:03:34,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:03:34,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:03:34,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:03:34,985 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:03:34,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:34,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:34,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:03:34,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:03:34,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:03:34,997 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:03:35,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:35,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:35,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:35,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:35,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:35,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:35,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... [2018-11-23 03:03:35,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:03:35,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:03:35,007 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:03:35,007 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:03:35,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:03:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:03:35,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:03:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:03:35,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:03:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:03:35,077 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:03:35,077 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 03:03:35,078 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 03:03:35,164 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:03:35,164 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 03:03:35,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:03:35 BoogieIcfgContainer [2018-11-23 03:03:35,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:03:35,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:03:35,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:03:35,167 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:03:35,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:03:34" (1/3) ... [2018-11-23 03:03:35,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf79f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:03:35, skipping insertion in model container [2018-11-23 03:03:35,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:03:34" (2/3) ... [2018-11-23 03:03:35,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf79f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:03:35, skipping insertion in model container [2018-11-23 03:03:35,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:03:35" (3/3) ... [2018-11-23 03:03:35,169 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i5_o5_false-unreach-call_true-termination.c [2018-11-23 03:03:35,175 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:03:35,179 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:03:35,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:03:35,206 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:03:35,207 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:03:35,207 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:03:35,207 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:03:35,207 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:03:35,207 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:03:35,207 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:03:35,207 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:03:35,207 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:03:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 03:03:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 03:03:35,221 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:03:35,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:03:35,223 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:03:35,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:03:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-23 03:03:35,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:03:35,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:03:35,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:35,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:03:35,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:03:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:03:35,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:03:35,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 03:03:35,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:03:35,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:03:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:03:35,369 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 03:03:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:03:35,419 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 03:03:35,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:03:35,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 03:03:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:03:35,427 INFO L225 Difference]: With dead ends: 30 [2018-11-23 03:03:35,427 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 03:03:35,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:03:35,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 03:03:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 03:03:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 03:03:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 03:03:35,455 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 03:03:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:03:35,456 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 03:03:35,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:03:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 03:03:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 03:03:35,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:03:35,457 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:03:35,457 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:03:35,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:03:35,457 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-23 03:03:35,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:03:35,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:03:35,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:35,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:03:35,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:03:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 03:03:35,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:03:35,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:03:35,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:03:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:03:35,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:03:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 03:03:35,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:03:35,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 03:03:35,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:03:35,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:03:35,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:03:35,588 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-23 03:03:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:03:35,653 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 03:03:35,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:03:35,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 03:03:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:03:35,655 INFO L225 Difference]: With dead ends: 25 [2018-11-23 03:03:35,655 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 03:03:35,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:03:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 03:03:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 03:03:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 03:03:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 03:03:35,659 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 03:03:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:03:35,660 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 03:03:35,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:03:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 03:03:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:03:35,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:03:35,661 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:03:35,661 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:03:35,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:03:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-23 03:03:35,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:03:35,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:03:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:35,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:03:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:03:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 03:03:35,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:03:35,727 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:03:35,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:03:35,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:03:35,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:03:35,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:03:35,780 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 03:03:35,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:03:35,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 03:03:35,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 03:03:35,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:03:35,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:03:35,796 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-23 03:03:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:03:35,865 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 03:03:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:03:35,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 03:03:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:03:35,866 INFO L225 Difference]: With dead ends: 28 [2018-11-23 03:03:35,867 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 03:03:35,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:03:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 03:03:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 03:03:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 03:03:35,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 03:03:35,871 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 03:03:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:03:35,871 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 03:03:35,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 03:03:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 03:03:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 03:03:35,872 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:03:35,872 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:03:35,872 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:03:35,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:03:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-23 03:03:35,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:03:35,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:03:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:35,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:03:35,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:03:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 03:03:35,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:03:35,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:03:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:03:35,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 03:03:35,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:03:35,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:03:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 03:03:36,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:03:36,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 03:03:36,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 03:03:36,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:03:36,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:03:36,009 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 11 states. [2018-11-23 03:03:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:03:36,042 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 03:03:36,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 03:03:36,042 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-23 03:03:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:03:36,042 INFO L225 Difference]: With dead ends: 31 [2018-11-23 03:03:36,042 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 03:03:36,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:03:36,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 03:03:36,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 03:03:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 03:03:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 03:03:36,045 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-23 03:03:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:03:36,046 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 03:03:36,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 03:03:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 03:03:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 03:03:36,046 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:03:36,046 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:03:36,047 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:03:36,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:03:36,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-11-23 03:03:36,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:03:36,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:03:36,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:36,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:03:36,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:03:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 03:03:36,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:03:36,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:03:36,116 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:03:36,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:03:36,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:03:36,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:03:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 03:03:36,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:03:36,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 03:03:36,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 03:03:36,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 03:03:36,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:03:36,156 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-23 03:03:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:03:36,218 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 03:03:36,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:03:36,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 03:03:36,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:03:36,221 INFO L225 Difference]: With dead ends: 34 [2018-11-23 03:03:36,221 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 03:03:36,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-23 03:03:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 03:03:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 03:03:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 03:03:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 03:03:36,226 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-23 03:03:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:03:36,226 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 03:03:36,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 03:03:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 03:03:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 03:03:36,227 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:03:36,227 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:03:36,227 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:03:36,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:03:36,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-11-23 03:03:36,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:03:36,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:03:36,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:36,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:03:36,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:03:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:03:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:03:36,262 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~input~0 := 5; VAL [main_~input~0=5] [?] CALL call #t~ret1 := id(~input~0); VAL [|id_#in~x|=5] [?] ~x := #in~x; VAL [id_~x=5, |id_#in~x|=5] [?] assume !(0 == ~x); VAL [id_~x=5, |id_#in~x|=5] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4] [?] ~x := #in~x; VAL [id_~x=4, |id_#in~x|=4] [?] assume !(0 == ~x); VAL [id_~x=4, |id_#in~x|=4] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=3] [?] ~x := #in~x; VAL [id_~x=3, |id_#in~x|=3] [?] assume !(0 == ~x); VAL [id_~x=3, |id_#in~x|=3] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=2] [?] ~x := #in~x; VAL [id_~x=2, |id_#in~x|=2] [?] assume !(0 == ~x); VAL [id_~x=2, |id_#in~x|=2] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=1] [?] ~x := #in~x; VAL [id_~x=1, |id_#in~x|=1] [?] assume !(0 == ~x); VAL [id_~x=1, |id_#in~x|=1] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=0] [?] ~x := #in~x; VAL [id_~x=0, |id_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] assume true; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] RET #32#return; VAL [id_~x=1, |id_#in~x|=1, |id_#t~ret0|=0] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] assume true; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] RET #32#return; VAL [id_~x=2, |id_#in~x|=2, |id_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] assume true; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] RET #32#return; VAL [id_~x=3, |id_#in~x|=3, |id_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] assume true; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4, |id_#in~x|=4, |id_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] assume true; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] RET #32#return; VAL [id_~x=5, |id_#in~x|=5, |id_#t~ret0|=4] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] assume true; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] RET #30#return; VAL [main_~input~0=5, |main_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=5, main_~result~0=5] [?] assume 5 == ~result~0; VAL [main_~input~0=5, main_~result~0=5] [?] assume !false; VAL [main_~input~0=5, main_~result~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12-L14] assume 5 == ~result~0; VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12-L14] assume 5 == ~result~0; VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] [L10] int input = 5; VAL [input=5] [L11] CALL, EXPR id(input) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=5, input=5] [L11] int result = id(input); [L12] COND TRUE result == 5 VAL [input=5, result=5] [L13] __VERIFIER_error() VAL [input=5, result=5] ----- [2018-11-23 03:03:36,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:03:36 BoogieIcfgContainer [2018-11-23 03:03:36,293 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:03:36,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:03:36,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:03:36,294 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:03:36,294 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:03:35" (3/4) ... [2018-11-23 03:03:36,296 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #26#return; [?] CALL call #t~ret2 := main(); [?] ~input~0 := 5; VAL [main_~input~0=5] [?] CALL call #t~ret1 := id(~input~0); VAL [|id_#in~x|=5] [?] ~x := #in~x; VAL [id_~x=5, |id_#in~x|=5] [?] assume !(0 == ~x); VAL [id_~x=5, |id_#in~x|=5] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=4] [?] ~x := #in~x; VAL [id_~x=4, |id_#in~x|=4] [?] assume !(0 == ~x); VAL [id_~x=4, |id_#in~x|=4] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=3] [?] ~x := #in~x; VAL [id_~x=3, |id_#in~x|=3] [?] assume !(0 == ~x); VAL [id_~x=3, |id_#in~x|=3] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=2] [?] ~x := #in~x; VAL [id_~x=2, |id_#in~x|=2] [?] assume !(0 == ~x); VAL [id_~x=2, |id_#in~x|=2] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=1] [?] ~x := #in~x; VAL [id_~x=1, |id_#in~x|=1] [?] assume !(0 == ~x); VAL [id_~x=1, |id_#in~x|=1] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=0] [?] ~x := #in~x; VAL [id_~x=0, |id_#in~x|=0] [?] assume 0 == ~x;#res := 0; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] assume true; VAL [id_~x=0, |id_#in~x|=0, |id_#res|=0] [?] RET #32#return; VAL [id_~x=1, |id_#in~x|=1, |id_#t~ret0|=0] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] assume true; VAL [id_~x=1, |id_#in~x|=1, |id_#res|=1] [?] RET #32#return; VAL [id_~x=2, |id_#in~x|=2, |id_#t~ret0|=1] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] assume true; VAL [id_~x=2, |id_#in~x|=2, |id_#res|=2] [?] RET #32#return; VAL [id_~x=3, |id_#in~x|=3, |id_#t~ret0|=2] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] assume true; VAL [id_~x=3, |id_#in~x|=3, |id_#res|=3] [?] RET #32#return; VAL [id_~x=4, |id_#in~x|=4, |id_#t~ret0|=3] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] assume true; VAL [id_~x=4, |id_#in~x|=4, |id_#res|=4] [?] RET #32#return; VAL [id_~x=5, |id_#in~x|=5, |id_#t~ret0|=4] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] assume true; VAL [id_~x=5, |id_#in~x|=5, |id_#res|=5] [?] RET #30#return; VAL [main_~input~0=5, |main_#t~ret1|=5] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=5, main_~result~0=5] [?] assume 5 == ~result~0; VAL [main_~input~0=5, main_~result~0=5] [?] assume !false; VAL [main_~input~0=5, main_~result~0=5] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12-L14] assume 5 == ~result~0; VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] assume !(0 == ~x); VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] assume !(0 == ~x); VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] assume !(0 == ~x); VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] assume !(0 == ~x); VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] assume !(0 == ~x); VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] assume 0 == ~x; [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L4-L7] ensures true; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L4-L7] ensures true; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L4-L7] ensures true; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L4-L7] ensures true; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L4-L7] ensures true; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L4-L7] ensures true; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12-L14] assume 5 == ~result~0; VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 5; VAL [~input~0=5] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=5] [L4-L7] ~x := #in~x; VAL [#in~x=5, ~x=5] [L5] COND FALSE !(0 == ~x) VAL [#in~x=5, ~x=5] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4] [L4-L7] ~x := #in~x; VAL [#in~x=4, ~x=4] [L5] COND FALSE !(0 == ~x) VAL [#in~x=4, ~x=4] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=3] [L4-L7] ~x := #in~x; VAL [#in~x=3, ~x=3] [L5] COND FALSE !(0 == ~x) VAL [#in~x=3, ~x=3] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=2] [L4-L7] ~x := #in~x; VAL [#in~x=2, ~x=2] [L5] COND FALSE !(0 == ~x) VAL [#in~x=2, ~x=2] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=1] [L4-L7] ~x := #in~x; VAL [#in~x=1, ~x=1] [L5] COND FALSE !(0 == ~x) VAL [#in~x=1, ~x=1] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=0] [L4-L7] ~x := #in~x; VAL [#in~x=0, ~x=0] [L5] COND TRUE 0 == ~x [L5] #res := 0; VAL [#in~x=0, #res=0, ~x=0] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=1, #t~ret0=0, ~x=1] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=1, #res=1, ~x=1] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=2, #t~ret0=1, ~x=2] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=2, #res=2, ~x=2] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=3, #t~ret0=2, ~x=3] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=3, #res=3, ~x=3] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4, #t~ret0=3, ~x=4] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4, #res=4, ~x=4] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=5, #t~ret0=4, ~x=5] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=5, #res=5, ~x=5] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=5, ~input~0=5] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=5, ~result~0=5] [L12] COND TRUE 5 == ~result~0 VAL [~input~0=5, ~result~0=5] [L13] assert false; VAL [~input~0=5, ~result~0=5] [L10] int input = 5; VAL [input=5] [L11] CALL, EXPR id(input) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=5, input=5] [L11] int result = id(input); [L12] COND TRUE result == 5 VAL [input=5, result=5] [L13] __VERIFIER_error() VAL [input=5, result=5] ----- [2018-11-23 03:03:36,340 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_afbce5c9-5736-499e-bdc9-8920a0229654/bin-2019/uautomizer/witness.graphml [2018-11-23 03:03:36,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:03:36,341 INFO L168 Benchmark]: Toolchain (without parser) took 1526.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 959.3 MB in the beginning and 973.8 MB in the end (delta: -14.5 MB). Peak memory consumption was 122.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:36,342 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:03:36,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.79 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:36,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.60 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:03:36,343 INFO L168 Benchmark]: Boogie Preprocessor took 10.25 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:36,344 INFO L168 Benchmark]: RCFGBuilder took 157.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:36,344 INFO L168 Benchmark]: TraceAbstraction took 1128.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.1 MB in the end (delta: 139.5 MB). Peak memory consumption was 139.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:36,344 INFO L168 Benchmark]: Witness Printer took 46.72 ms. Allocated memory is still 1.2 GB. Free memory was 977.1 MB in the beginning and 973.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 03:03:36,347 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.79 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 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 11.60 ms. Allocated memory is still 1.0 GB. Free memory is still 948.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.25 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1128.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 977.1 MB in the end (delta: 139.5 MB). Peak memory consumption was 139.5 MB. Max. memory is 11.5 GB. * Witness Printer took 46.72 ms. Allocated memory is still 1.2 GB. Free memory was 977.1 MB in the beginning and 973.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 5; VAL [input=5] [L11] CALL, EXPR id(input) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=5, input=5] [L11] int result = id(input); [L12] COND TRUE result == 5 VAL [input=5, result=5] [L13] __VERIFIER_error() VAL [input=5, result=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 1.0s OverallTime, 6 OverallIterations, 6 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 71 SDtfs, 45 SDslu, 311 SDs, 0 SdLazy, 134 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 280 NumberOfCodeBlocks, 275 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 13440 SizeOfPredicates, 14 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 100/200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...