./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i20_o20_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_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/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 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-22 23:53:05,421 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:53:05,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:53:05,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:53:05,432 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:53:05,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:53:05,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:53:05,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:53:05,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:53:05,437 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:53:05,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:53:05,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:53:05,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:53:05,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:53:05,440 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:53:05,440 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:53:05,442 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:53:05,443 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:53:05,445 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:53:05,446 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:53:05,447 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:53:05,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:53:05,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:53:05,451 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:53:05,451 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:53:05,452 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:53:05,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:53:05,453 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:53:05,454 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:53:05,455 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:53:05,455 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:53:05,456 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:53:05,456 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:53:05,456 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:53:05,457 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:53:05,458 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:53:05,459 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 23:53:05,470 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:53:05,470 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:53:05,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:53:05,471 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:53:05,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:53:05,471 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:53:05,472 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:53:05,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:53:05,472 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:53:05,472 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:53:05,472 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:53:05,472 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:53:05,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:53:05,473 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:53:05,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:53:05,474 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:53:05,474 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:53:05,474 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:53:05,474 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:53:05,474 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:53:05,475 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:53:05,475 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:53:05,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:53:05,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:53:05,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:53:05,475 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:53:05,475 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:53:05,476 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:53:05,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:53:05,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:53:05,476 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_8b7975b2-b790-49bf-9f7e-c9026668faf8/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 -> 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b [2018-11-22 23:53:05,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:53:05,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:53:05,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:53:05,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:53:05,519 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:53:05,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c [2018-11-22 23:53:05,573 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/data/73756f65d/0162fb11766d46708deddba173baa9bf/FLAGe3f711ed6 [2018-11-22 23:53:05,918 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:53:05,919 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/sv-benchmarks/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c [2018-11-22 23:53:05,923 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/data/73756f65d/0162fb11766d46708deddba173baa9bf/FLAGe3f711ed6 [2018-11-22 23:53:05,934 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/data/73756f65d/0162fb11766d46708deddba173baa9bf [2018-11-22 23:53:05,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:53:05,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:53:05,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:53:05,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:53:05,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:53:05,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:53:05" (1/1) ... [2018-11-22 23:53:05,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f370fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:05, skipping insertion in model container [2018-11-22 23:53:05,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:53:05" (1/1) ... [2018-11-22 23:53:05,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:53:05,963 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:53:06,075 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:53:06,078 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:53:06,087 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:53:06,098 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:53:06,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06 WrapperNode [2018-11-22 23:53:06,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:53:06,099 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:53:06,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:53:06,099 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:53:06,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... [2018-11-22 23:53:06,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... [2018-11-22 23:53:06,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:53:06,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:53:06,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:53:06,113 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:53:06,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... [2018-11-22 23:53:06,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... [2018-11-22 23:53:06,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... [2018-11-22 23:53:06,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... [2018-11-22 23:53:06,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... [2018-11-22 23:53:06,123 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... [2018-11-22 23:53:06,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... [2018-11-22 23:53:06,124 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:53:06,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:53:06,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:53:06,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:53:06,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/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-22 23:53:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:53:06,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:53:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:53:06,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:53:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:53:06,203 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:53:06,203 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-22 23:53:06,203 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-22 23:53:06,305 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:53:06,305 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-22 23:53:06,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:53:06 BoogieIcfgContainer [2018-11-22 23:53:06,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:53:06,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:53:06,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:53:06,309 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:53:06,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:53:05" (1/3) ... [2018-11-22 23:53:06,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111060a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:53:06, skipping insertion in model container [2018-11-22 23:53:06,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:53:06" (2/3) ... [2018-11-22 23:53:06,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@111060a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:53:06, skipping insertion in model container [2018-11-22 23:53:06,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:53:06" (3/3) ... [2018-11-22 23:53:06,312 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i20_o20_false-unreach-call_true-termination.c [2018-11-22 23:53:06,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:53:06,324 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:53:06,335 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:53:06,356 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:53:06,357 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:53:06,357 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:53:06,357 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:53:06,357 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:53:06,357 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:53:06,357 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:53:06,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:53:06,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:53:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-22 23:53:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 23:53:06,373 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:06,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:06,375 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:06,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-22 23:53:06,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:06,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:06,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:06,520 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-22 23:53:06,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:53:06,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-22 23:53:06,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:53:06,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:53:06,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:53:06,543 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-22 23:53:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:06,647 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-22 23:53:06,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:53:06,649 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-22 23:53:06,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:06,657 INFO L225 Difference]: With dead ends: 30 [2018-11-22 23:53:06,657 INFO L226 Difference]: Without dead ends: 18 [2018-11-22 23:53:06,660 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-22 23:53:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-22 23:53:06,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-22 23:53:06,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-22 23:53:06,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-22 23:53:06,694 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-22 23:53:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:06,694 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-22 23:53:06,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:53:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-22 23:53:06,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 23:53:06,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:06,696 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:06,697 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:06,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:06,697 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-22 23:53:06,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:06,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:06,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:06,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:06,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:06,754 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-22 23:53:06,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:06,755 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/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-22 23:53:06,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:06,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:06,824 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-22 23:53:06,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:06,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-22 23:53:06,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:53:06,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:53:06,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:53:06,847 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-22 23:53:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:06,908 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-22 23:53:06,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:53:06,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-22 23:53:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:06,909 INFO L225 Difference]: With dead ends: 25 [2018-11-22 23:53:06,909 INFO L226 Difference]: Without dead ends: 21 [2018-11-22 23:53:06,910 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-22 23:53:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-22 23:53:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-22 23:53:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 23:53:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-22 23:53:06,915 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-22 23:53:06,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:06,916 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-22 23:53:06,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:53:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-22 23:53:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 23:53:06,917 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:06,917 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:06,917 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:06,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-22 23:53:06,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:06,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:06,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:06,985 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-22 23:53:06,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:06,986 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/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-22 23:53:07,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:53:07,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:53:07,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:07,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:07,038 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-22 23:53:07,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:07,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-22 23:53:07,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 23:53:07,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 23:53:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:53:07,056 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-22 23:53:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:07,112 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-22 23:53:07,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:53:07,113 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-22 23:53:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:07,114 INFO L225 Difference]: With dead ends: 28 [2018-11-22 23:53:07,114 INFO L226 Difference]: Without dead ends: 24 [2018-11-22 23:53:07,115 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-22 23:53:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-22 23:53:07,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-22 23:53:07,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-22 23:53:07,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-22 23:53:07,121 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-22 23:53:07,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:07,121 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-22 23:53:07,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 23:53:07,122 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-22 23:53:07,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 23:53:07,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:07,123 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:07,123 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:07,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:07,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-22 23:53:07,123 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:07,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:07,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:07,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:07,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:07,212 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-22 23:53:07,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:07,212 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/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-22 23:53:07,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:53:07,237 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-22 23:53:07,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:07,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:07,247 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-22 23:53:07,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:07,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-22 23:53:07,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 23:53:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 23:53:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-22 23:53:07,276 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 11 states. [2018-11-22 23:53:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:07,295 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-22 23:53:07,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 23:53:07,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-22 23:53:07,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:07,296 INFO L225 Difference]: With dead ends: 31 [2018-11-22 23:53:07,296 INFO L226 Difference]: Without dead ends: 27 [2018-11-22 23:53:07,296 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-22 23:53:07,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-22 23:53:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-22 23:53:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 23:53:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-22 23:53:07,300 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-22 23:53:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:07,300 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-22 23:53:07,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 23:53:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-22 23:53:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-22 23:53:07,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:07,302 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:07,302 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:07,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-11-22 23:53:07,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:07,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:07,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:07,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:07,388 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-22 23:53:07,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:07,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/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-22 23:53:07,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:53:07,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:53:07,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:07,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:07,435 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-22 23:53:07,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:07,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-22 23:53:07,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 23:53:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 23:53:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-22 23:53:07,456 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-22 23:53:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:07,531 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-22 23:53:07,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 23:53:07,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-22 23:53:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:07,533 INFO L225 Difference]: With dead ends: 34 [2018-11-22 23:53:07,533 INFO L226 Difference]: Without dead ends: 30 [2018-11-22 23:53:07,534 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-22 23:53:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-22 23:53:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-22 23:53:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 23:53:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-22 23:53:07,537 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-22 23:53:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:07,538 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-22 23:53:07,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 23:53:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-22 23:53:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-22 23:53:07,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:07,539 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:07,539 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:07,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-11-22 23:53:07,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:07,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:07,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:07,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:07,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-22 23:53:07,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:07,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:07,673 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 23:53:07,692 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-22 23:53:07,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:07,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:07,704 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-22 23:53:07,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:07,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-22 23:53:07,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 23:53:07,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 23:53:07,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-22 23:53:07,721 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2018-11-22 23:53:07,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:07,752 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-22 23:53:07,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 23:53:07,753 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-11-22 23:53:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:07,754 INFO L225 Difference]: With dead ends: 37 [2018-11-22 23:53:07,754 INFO L226 Difference]: Without dead ends: 33 [2018-11-22 23:53:07,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-22 23:53:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-22 23:53:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-22 23:53:07,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 23:53:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-22 23:53:07,761 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-22 23:53:07,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:07,762 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-22 23:53:07,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 23:53:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-22 23:53:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-22 23:53:07,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:07,763 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:07,763 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:07,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:07,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-11-22 23:53:07,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:07,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:07,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:07,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-22 23:53:07,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:07,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:07,935 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 23:53:07,952 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-22 23:53:07,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:07,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-22 23:53:08,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:08,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-11-22 23:53:08,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-22 23:53:08,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-22 23:53:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-11-22 23:53:08,085 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 26 states. [2018-11-22 23:53:08,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:08,319 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-22 23:53:08,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 23:53:08,320 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-11-22 23:53:08,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:08,320 INFO L225 Difference]: With dead ends: 40 [2018-11-22 23:53:08,321 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 23:53:08,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=279, Invalid=1203, Unknown=0, NotChecked=0, Total=1482 [2018-11-22 23:53:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 23:53:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-22 23:53:08,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-22 23:53:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-22 23:53:08,325 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-22 23:53:08,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:08,326 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-22 23:53:08,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-22 23:53:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-22 23:53:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-22 23:53:08,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:08,327 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:08,327 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:08,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:08,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-11-22 23:53:08,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:08,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:08,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:08,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:08,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-22 23:53:08,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:08,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:08,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:08,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-11-22 23:53:08,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:08,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2018-11-22 23:53:08,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-22 23:53:08,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-22 23:53:08,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2018-11-22 23:53:08,619 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 29 states. [2018-11-22 23:53:08,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:08,890 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-22 23:53:08,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-22 23:53:08,891 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-11-22 23:53:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:08,892 INFO L225 Difference]: With dead ends: 43 [2018-11-22 23:53:08,892 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 23:53:08,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=354, Invalid=1538, Unknown=0, NotChecked=0, Total=1892 [2018-11-22 23:53:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 23:53:08,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-22 23:53:08,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 23:53:08,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-22 23:53:08,900 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-22 23:53:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:08,900 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-22 23:53:08,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-22 23:53:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-22 23:53:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-22 23:53:08,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:08,901 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:08,901 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:08,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:08,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-11-22 23:53:08,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:08,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:08,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:08,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-22 23:53:09,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:09,002 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:09,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:53:09,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:53:09,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:09,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-22 23:53:09,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:09,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-22 23:53:09,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 23:53:09,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 23:53:09,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:53:09,061 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-11-22 23:53:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:09,133 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-22 23:53:09,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-22 23:53:09,134 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-22 23:53:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:09,134 INFO L225 Difference]: With dead ends: 46 [2018-11-22 23:53:09,134 INFO L226 Difference]: Without dead ends: 42 [2018-11-22 23:53:09,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-11-22 23:53:09,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-22 23:53:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-22 23:53:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-22 23:53:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-22 23:53:09,138 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-22 23:53:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:09,139 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-22 23:53:09,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 23:53:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-22 23:53:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-22 23:53:09,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:09,139 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:09,139 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:09,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:09,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-11-22 23:53:09,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:09,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:09,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:09,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:09,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-22 23:53:09,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:09,247 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:09,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:53:09,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-22 23:53:09,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:09,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-11-22 23:53:09,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:09,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2018-11-22 23:53:09,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-22 23:53:09,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-22 23:53:09,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2018-11-22 23:53:09,542 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 35 states. [2018-11-22 23:53:09,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:09,876 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-22 23:53:09,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-22 23:53:09,876 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-11-22 23:53:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:09,877 INFO L225 Difference]: With dead ends: 49 [2018-11-22 23:53:09,877 INFO L226 Difference]: Without dead ends: 45 [2018-11-22 23:53:09,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=531, Invalid=2331, Unknown=0, NotChecked=0, Total=2862 [2018-11-22 23:53:09,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-22 23:53:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-22 23:53:09,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-22 23:53:09,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-22 23:53:09,881 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-22 23:53:09,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:09,882 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-22 23:53:09,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-22 23:53:09,882 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-22 23:53:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-22 23:53:09,883 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:09,883 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:09,883 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:09,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:09,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-11-22 23:53:09,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:09,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:09,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:09,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:09,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-22 23:53:09,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:09,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:09,996 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:53:10,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:53:10,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:10,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-11-22 23:53:10,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:10,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-22 23:53:10,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 23:53:10,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 23:53:10,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-11-22 23:53:10,046 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-11-22 23:53:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:10,154 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-22 23:53:10,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 23:53:10,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-11-22 23:53:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:10,155 INFO L225 Difference]: With dead ends: 52 [2018-11-22 23:53:10,155 INFO L226 Difference]: Without dead ends: 48 [2018-11-22 23:53:10,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-11-22 23:53:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-22 23:53:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-22 23:53:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-22 23:53:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-22 23:53:10,160 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-11-22 23:53:10,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:10,160 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-22 23:53:10,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 23:53:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-22 23:53:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-22 23:53:10,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:10,161 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:10,161 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:10,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2018-11-22 23:53:10,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:10,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:10,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:10,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-22 23:53:10,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:10,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:10,290 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 23:53:10,319 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-22 23:53:10,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:10,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-11-22 23:53:10,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:10,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-22 23:53:10,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-22 23:53:10,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-22 23:53:10,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-11-22 23:53:10,361 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2018-11-22 23:53:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:10,492 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-22 23:53:10,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 23:53:10,493 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-11-22 23:53:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:10,494 INFO L225 Difference]: With dead ends: 55 [2018-11-22 23:53:10,494 INFO L226 Difference]: Without dead ends: 51 [2018-11-22 23:53:10,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-11-22 23:53:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-22 23:53:10,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-22 23:53:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-22 23:53:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-22 23:53:10,499 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-11-22 23:53:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:10,500 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-22 23:53:10,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-22 23:53:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-22 23:53:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-22 23:53:10,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:10,501 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:10,501 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:10,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:10,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2018-11-22 23:53:10,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:10,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:10,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:10,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:10,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-22 23:53:10,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:10,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:10,694 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 23:53:10,717 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-22 23:53:10,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:10,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-11-22 23:53:10,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:10,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-22 23:53:10,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-22 23:53:10,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-22 23:53:10,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-11-22 23:53:10,754 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 29 states. [2018-11-22 23:53:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:10,792 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-22 23:53:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-22 23:53:10,792 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-11-22 23:53:10,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:10,792 INFO L225 Difference]: With dead ends: 58 [2018-11-22 23:53:10,793 INFO L226 Difference]: Without dead ends: 54 [2018-11-22 23:53:10,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-11-22 23:53:10,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-22 23:53:10,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-22 23:53:10,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-22 23:53:10,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-22 23:53:10,796 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-11-22 23:53:10,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:10,796 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-22 23:53:10,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-22 23:53:10,797 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-22 23:53:10,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-22 23:53:10,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:10,797 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:10,797 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:10,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:10,798 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2018-11-22 23:53:10,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:10,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:10,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:10,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:10,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:11,077 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-22 23:53:11,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:11,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:11,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:11,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-11-22 23:53:11,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:11,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18] total 47 [2018-11-22 23:53:11,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-22 23:53:11,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-22 23:53:11,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2018-11-22 23:53:11,428 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 47 states. [2018-11-22 23:53:11,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:11,879 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-22 23:53:11,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-22 23:53:11,879 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2018-11-22 23:53:11,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:11,880 INFO L225 Difference]: With dead ends: 61 [2018-11-22 23:53:11,880 INFO L226 Difference]: Without dead ends: 57 [2018-11-22 23:53:11,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=993, Invalid=4409, Unknown=0, NotChecked=0, Total=5402 [2018-11-22 23:53:11,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-22 23:53:11,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-22 23:53:11,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-22 23:53:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-22 23:53:11,886 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-11-22 23:53:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:11,886 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-22 23:53:11,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-22 23:53:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-22 23:53:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-22 23:53:11,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:11,887 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:11,887 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:11,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:11,888 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2018-11-22 23:53:11,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:11,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:11,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:11,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-22 23:53:12,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:12,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:12,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:53:12,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:53:12,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:12,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-11-22 23:53:12,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:12,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2018-11-22 23:53:12,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-22 23:53:12,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-22 23:53:12,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2052, Unknown=0, NotChecked=0, Total=2450 [2018-11-22 23:53:12,425 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 50 states. [2018-11-22 23:53:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:12,922 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-22 23:53:12,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-22 23:53:12,922 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2018-11-22 23:53:12,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:12,922 INFO L225 Difference]: With dead ends: 64 [2018-11-22 23:53:12,922 INFO L226 Difference]: Without dead ends: 60 [2018-11-22 23:53:12,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1131, Invalid=5031, Unknown=0, NotChecked=0, Total=6162 [2018-11-22 23:53:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-22 23:53:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-22 23:53:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-22 23:53:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-22 23:53:12,928 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-11-22 23:53:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:12,929 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-22 23:53:12,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-22 23:53:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-22 23:53:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-22 23:53:12,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:12,930 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:12,930 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:12,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2018-11-22 23:53:12,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:12,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:12,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:12,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:12,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-22 23:53:13,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:13,181 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:13,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:53:13,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-22 23:53:13,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:13,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-11-22 23:53:13,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:13,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 20] total 53 [2018-11-22 23:53:13,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-22 23:53:13,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-22 23:53:13,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=2308, Unknown=0, NotChecked=0, Total=2756 [2018-11-22 23:53:13,503 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 53 states. [2018-11-22 23:53:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:14,041 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-11-22 23:53:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-22 23:53:14,041 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2018-11-22 23:53:14,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:14,042 INFO L225 Difference]: With dead ends: 67 [2018-11-22 23:53:14,042 INFO L226 Difference]: Without dead ends: 63 [2018-11-22 23:53:14,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=5694, Unknown=0, NotChecked=0, Total=6972 [2018-11-22 23:53:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-22 23:53:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-22 23:53:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-22 23:53:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-11-22 23:53:14,047 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2018-11-22 23:53:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:14,047 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-22 23:53:14,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-22 23:53:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-22 23:53:14,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-22 23:53:14,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:14,049 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:14,049 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:14,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:14,049 INFO L82 PathProgramCache]: Analyzing trace with hash 404015613, now seen corresponding path program 16 times [2018-11-22 23:53:14,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:14,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:14,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:14,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-22 23:53:14,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:14,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:14,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:53:14,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:53:14,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:14,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-22 23:53:14,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:14,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 21] total 56 [2018-11-22 23:53:14,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-22 23:53:14,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-22 23:53:14,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2579, Unknown=0, NotChecked=0, Total=3080 [2018-11-22 23:53:14,735 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 56 states. [2018-11-22 23:53:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:15,333 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-22 23:53:15,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-22 23:53:15,333 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2018-11-22 23:53:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:15,334 INFO L225 Difference]: With dead ends: 70 [2018-11-22 23:53:15,334 INFO L226 Difference]: Without dead ends: 66 [2018-11-22 23:53:15,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1434, Invalid=6398, Unknown=0, NotChecked=0, Total=7832 [2018-11-22 23:53:15,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-22 23:53:15,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-22 23:53:15,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-22 23:53:15,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-22 23:53:15,339 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 109 [2018-11-22 23:53:15,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:15,339 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-22 23:53:15,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-22 23:53:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-22 23:53:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-22 23:53:15,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:15,340 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:15,340 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:15,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:15,340 INFO L82 PathProgramCache]: Analyzing trace with hash -464475409, now seen corresponding path program 17 times [2018-11-22 23:53:15,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:15,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:15,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:15,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:15,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:15,511 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-22 23:53:15,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:15,512 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:15,519 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 23:53:15,556 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-22 23:53:15,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:15,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:16,055 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2018-11-22 23:53:16,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:16,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 39] total 59 [2018-11-22 23:53:16,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-11-22 23:53:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-11-22 23:53:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=2865, Unknown=0, NotChecked=0, Total=3422 [2018-11-22 23:53:16,071 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 59 states. [2018-11-22 23:53:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:16,695 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-11-22 23:53:16,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-22 23:53:16,695 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2018-11-22 23:53:16,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:16,696 INFO L225 Difference]: With dead ends: 73 [2018-11-22 23:53:16,696 INFO L226 Difference]: Without dead ends: 69 [2018-11-22 23:53:16,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1599, Invalid=7143, Unknown=0, NotChecked=0, Total=8742 [2018-11-22 23:53:16,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-22 23:53:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-11-22 23:53:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-22 23:53:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-22 23:53:16,702 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 115 [2018-11-22 23:53:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:16,702 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-22 23:53:16,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-11-22 23:53:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-22 23:53:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-22 23:53:16,703 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:16,703 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:16,703 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:16,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash 130115453, now seen corresponding path program 18 times [2018-11-22 23:53:16,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:16,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:16,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:16,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:16,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:16,896 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-22 23:53:16,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:16,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:16,904 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 23:53:16,937 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-22 23:53:16,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:53:16,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2018-11-22 23:53:17,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:17,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 41] total 62 [2018-11-22 23:53:17,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-11-22 23:53:17,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-11-22 23:53:17,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=616, Invalid=3166, Unknown=0, NotChecked=0, Total=3782 [2018-11-22 23:53:17,510 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 62 states. [2018-11-22 23:53:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:18,190 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-22 23:53:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-22 23:53:18,190 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2018-11-22 23:53:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:18,191 INFO L225 Difference]: With dead ends: 76 [2018-11-22 23:53:18,191 INFO L226 Difference]: Without dead ends: 72 [2018-11-22 23:53:18,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1744 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1773, Invalid=7929, Unknown=0, NotChecked=0, Total=9702 [2018-11-22 23:53:18,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-22 23:53:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-22 23:53:18,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-22 23:53:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-22 23:53:18,196 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 121 [2018-11-22 23:53:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:18,196 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-22 23:53:18,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-11-22 23:53:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-22 23:53:18,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-22 23:53:18,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:18,197 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:18,197 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:18,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:18,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2010955025, now seen corresponding path program 19 times [2018-11-22 23:53:18,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:18,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:18,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:53:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-22 23:53:18,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:53:18,395 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:53:18,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:53:18,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:53:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2018-11-22 23:53:18,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:53:18,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-22 23:53:18,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-22 23:53:18,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-22 23:53:18,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2018-11-22 23:53:18,485 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 24 states. [2018-11-22 23:53:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:53:18,727 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-11-22 23:53:18,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-22 23:53:18,727 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2018-11-22 23:53:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:53:18,728 INFO L225 Difference]: With dead ends: 79 [2018-11-22 23:53:18,728 INFO L226 Difference]: Without dead ends: 75 [2018-11-22 23:53:18,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-11-22 23:53:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-22 23:53:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-22 23:53:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-22 23:53:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-11-22 23:53:18,732 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 127 [2018-11-22 23:53:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:53:18,732 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-11-22 23:53:18,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-22 23:53:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-11-22 23:53:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-22 23:53:18,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:53:18,733 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:53:18,734 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:53:18,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:53:18,734 INFO L82 PathProgramCache]: Analyzing trace with hash -799288067, now seen corresponding path program 20 times [2018-11-22 23:53:18,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:53:18,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:53:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:18,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:53:18,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:53:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:53:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:53:18,763 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 := 20; VAL [main_~input~0=20] [?] CALL call #t~ret1 := id(~input~0); VAL [|id_#in~x|=20] [?] ~x := #in~x; VAL [id_~x=20, |id_#in~x|=20] [?] assume !(0 == ~x); VAL [id_~x=20, |id_#in~x|=20] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=19] [?] ~x := #in~x; VAL [id_~x=19, |id_#in~x|=19] [?] assume !(0 == ~x); VAL [id_~x=19, |id_#in~x|=19] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=18] [?] ~x := #in~x; VAL [id_~x=18, |id_#in~x|=18] [?] assume !(0 == ~x); VAL [id_~x=18, |id_#in~x|=18] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=17] [?] ~x := #in~x; VAL [id_~x=17, |id_#in~x|=17] [?] assume !(0 == ~x); VAL [id_~x=17, |id_#in~x|=17] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=16] [?] ~x := #in~x; VAL [id_~x=16, |id_#in~x|=16] [?] assume !(0 == ~x); VAL [id_~x=16, |id_#in~x|=16] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=15] [?] ~x := #in~x; VAL [id_~x=15, |id_#in~x|=15] [?] assume !(0 == ~x); VAL [id_~x=15, |id_#in~x|=15] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=14] [?] ~x := #in~x; VAL [id_~x=14, |id_#in~x|=14] [?] assume !(0 == ~x); VAL [id_~x=14, |id_#in~x|=14] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=13] [?] ~x := #in~x; VAL [id_~x=13, |id_#in~x|=13] [?] assume !(0 == ~x); VAL [id_~x=13, |id_#in~x|=13] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=12] [?] ~x := #in~x; VAL [id_~x=12, |id_#in~x|=12] [?] assume !(0 == ~x); VAL [id_~x=12, |id_#in~x|=12] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=11] [?] ~x := #in~x; VAL [id_~x=11, |id_#in~x|=11] [?] assume !(0 == ~x); VAL [id_~x=11, |id_#in~x|=11] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=10] [?] ~x := #in~x; VAL [id_~x=10, |id_#in~x|=10] [?] assume !(0 == ~x); VAL [id_~x=10, |id_#in~x|=10] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=9] [?] ~x := #in~x; VAL [id_~x=9, |id_#in~x|=9] [?] assume !(0 == ~x); VAL [id_~x=9, |id_#in~x|=9] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=8] [?] ~x := #in~x; VAL [id_~x=8, |id_#in~x|=8] [?] assume !(0 == ~x); VAL [id_~x=8, |id_#in~x|=8] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=7] [?] ~x := #in~x; VAL [id_~x=7, |id_#in~x|=7] [?] assume !(0 == ~x); VAL [id_~x=7, |id_#in~x|=7] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=6] [?] ~x := #in~x; VAL [id_~x=6, |id_#in~x|=6] [?] assume !(0 == ~x); VAL [id_~x=6, |id_#in~x|=6] [?] CALL call #t~ret0 := id(~x - 1); 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 #32#return; VAL [id_~x=6, |id_#in~x|=6, |id_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] assume true; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] RET #32#return; VAL [id_~x=7, |id_#in~x|=7, |id_#t~ret0|=6] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] assume true; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] RET #32#return; VAL [id_~x=8, |id_#in~x|=8, |id_#t~ret0|=7] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] assume true; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] RET #32#return; VAL [id_~x=9, |id_#in~x|=9, |id_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] assume true; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] RET #32#return; VAL [id_~x=10, |id_#in~x|=10, |id_#t~ret0|=9] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] assume true; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] RET #32#return; VAL [id_~x=11, |id_#in~x|=11, |id_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=11, |id_#in~x|=11, |id_#res|=11] [?] assume true; VAL [id_~x=11, |id_#in~x|=11, |id_#res|=11] [?] RET #32#return; VAL [id_~x=12, |id_#in~x|=12, |id_#t~ret0|=11] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=12, |id_#in~x|=12, |id_#res|=12] [?] assume true; VAL [id_~x=12, |id_#in~x|=12, |id_#res|=12] [?] RET #32#return; VAL [id_~x=13, |id_#in~x|=13, |id_#t~ret0|=12] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=13, |id_#in~x|=13, |id_#res|=13] [?] assume true; VAL [id_~x=13, |id_#in~x|=13, |id_#res|=13] [?] RET #32#return; VAL [id_~x=14, |id_#in~x|=14, |id_#t~ret0|=13] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=14, |id_#in~x|=14, |id_#res|=14] [?] assume true; VAL [id_~x=14, |id_#in~x|=14, |id_#res|=14] [?] RET #32#return; VAL [id_~x=15, |id_#in~x|=15, |id_#t~ret0|=14] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=15, |id_#in~x|=15, |id_#res|=15] [?] assume true; VAL [id_~x=15, |id_#in~x|=15, |id_#res|=15] [?] RET #32#return; VAL [id_~x=16, |id_#in~x|=16, |id_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=16, |id_#in~x|=16, |id_#res|=16] [?] assume true; VAL [id_~x=16, |id_#in~x|=16, |id_#res|=16] [?] RET #32#return; VAL [id_~x=17, |id_#in~x|=17, |id_#t~ret0|=16] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=17, |id_#in~x|=17, |id_#res|=17] [?] assume true; VAL [id_~x=17, |id_#in~x|=17, |id_#res|=17] [?] RET #32#return; VAL [id_~x=18, |id_#in~x|=18, |id_#t~ret0|=17] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=18, |id_#in~x|=18, |id_#res|=18] [?] assume true; VAL [id_~x=18, |id_#in~x|=18, |id_#res|=18] [?] RET #32#return; VAL [id_~x=19, |id_#in~x|=19, |id_#t~ret0|=18] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=19, |id_#in~x|=19, |id_#res|=19] [?] assume true; VAL [id_~x=19, |id_#in~x|=19, |id_#res|=19] [?] RET #32#return; VAL [id_~x=20, |id_#in~x|=20, |id_#t~ret0|=19] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=20, |id_#in~x|=20, |id_#res|=20] [?] assume true; VAL [id_~x=20, |id_#in~x|=20, |id_#res|=20] [?] RET #30#return; VAL [main_~input~0=20, |main_#t~ret1|=20] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=20, main_~result~0=20] [?] assume 20 == ~result~0; VAL [main_~input~0=20, main_~result~0=20] [?] assume !false; VAL [main_~input~0=20, main_~result~0=20] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] assume !(0 == ~x); VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] assume !(0 == ~x); VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] assume !(0 == ~x); VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] assume !(0 == ~x); VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] assume !(0 == ~x); VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] assume !(0 == ~x); VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] assume !(0 == ~x); VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] assume !(0 == ~x); VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] assume !(0 == ~x); VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] assume !(0 == ~x); VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L4-L7] ensures true; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L4-L7] ensures true; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L4-L7] ensures true; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L4-L7] ensures true; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L4-L7] ensures true; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L4-L7] ensures true; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L4-L7] ensures true; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L4-L7] ensures true; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L4-L7] ensures true; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L4-L7] ensures true; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12-L14] assume 20 == ~result~0; VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- 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 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] assume !(0 == ~x); VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] assume !(0 == ~x); VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] assume !(0 == ~x); VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] assume !(0 == ~x); VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] assume !(0 == ~x); VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] assume !(0 == ~x); VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] assume !(0 == ~x); VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] assume !(0 == ~x); VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] assume !(0 == ~x); VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] assume !(0 == ~x); VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L4-L7] ensures true; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L4-L7] ensures true; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L4-L7] ensures true; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L4-L7] ensures true; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L4-L7] ensures true; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L4-L7] ensures true; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L4-L7] ensures true; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L4-L7] ensures true; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L4-L7] ensures true; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L4-L7] ensures true; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12-L14] assume 20 == ~result~0; VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- 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 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- 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 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [L10] int input = 20; VAL [input=20] [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) 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; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] ----- [2018-11-22 23:53:18,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:53:18 BoogieIcfgContainer [2018-11-22 23:53:18,928 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:53:18,929 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:53:18,929 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:53:18,929 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:53:18,930 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:53:06" (3/4) ... [2018-11-22 23:53:18,932 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 := 20; VAL [main_~input~0=20] [?] CALL call #t~ret1 := id(~input~0); VAL [|id_#in~x|=20] [?] ~x := #in~x; VAL [id_~x=20, |id_#in~x|=20] [?] assume !(0 == ~x); VAL [id_~x=20, |id_#in~x|=20] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=19] [?] ~x := #in~x; VAL [id_~x=19, |id_#in~x|=19] [?] assume !(0 == ~x); VAL [id_~x=19, |id_#in~x|=19] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=18] [?] ~x := #in~x; VAL [id_~x=18, |id_#in~x|=18] [?] assume !(0 == ~x); VAL [id_~x=18, |id_#in~x|=18] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=17] [?] ~x := #in~x; VAL [id_~x=17, |id_#in~x|=17] [?] assume !(0 == ~x); VAL [id_~x=17, |id_#in~x|=17] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=16] [?] ~x := #in~x; VAL [id_~x=16, |id_#in~x|=16] [?] assume !(0 == ~x); VAL [id_~x=16, |id_#in~x|=16] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=15] [?] ~x := #in~x; VAL [id_~x=15, |id_#in~x|=15] [?] assume !(0 == ~x); VAL [id_~x=15, |id_#in~x|=15] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=14] [?] ~x := #in~x; VAL [id_~x=14, |id_#in~x|=14] [?] assume !(0 == ~x); VAL [id_~x=14, |id_#in~x|=14] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=13] [?] ~x := #in~x; VAL [id_~x=13, |id_#in~x|=13] [?] assume !(0 == ~x); VAL [id_~x=13, |id_#in~x|=13] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=12] [?] ~x := #in~x; VAL [id_~x=12, |id_#in~x|=12] [?] assume !(0 == ~x); VAL [id_~x=12, |id_#in~x|=12] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=11] [?] ~x := #in~x; VAL [id_~x=11, |id_#in~x|=11] [?] assume !(0 == ~x); VAL [id_~x=11, |id_#in~x|=11] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=10] [?] ~x := #in~x; VAL [id_~x=10, |id_#in~x|=10] [?] assume !(0 == ~x); VAL [id_~x=10, |id_#in~x|=10] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=9] [?] ~x := #in~x; VAL [id_~x=9, |id_#in~x|=9] [?] assume !(0 == ~x); VAL [id_~x=9, |id_#in~x|=9] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=8] [?] ~x := #in~x; VAL [id_~x=8, |id_#in~x|=8] [?] assume !(0 == ~x); VAL [id_~x=8, |id_#in~x|=8] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=7] [?] ~x := #in~x; VAL [id_~x=7, |id_#in~x|=7] [?] assume !(0 == ~x); VAL [id_~x=7, |id_#in~x|=7] [?] CALL call #t~ret0 := id(~x - 1); VAL [|id_#in~x|=6] [?] ~x := #in~x; VAL [id_~x=6, |id_#in~x|=6] [?] assume !(0 == ~x); VAL [id_~x=6, |id_#in~x|=6] [?] CALL call #t~ret0 := id(~x - 1); 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 #32#return; VAL [id_~x=6, |id_#in~x|=6, |id_#t~ret0|=5] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] assume true; VAL [id_~x=6, |id_#in~x|=6, |id_#res|=6] [?] RET #32#return; VAL [id_~x=7, |id_#in~x|=7, |id_#t~ret0|=6] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] assume true; VAL [id_~x=7, |id_#in~x|=7, |id_#res|=7] [?] RET #32#return; VAL [id_~x=8, |id_#in~x|=8, |id_#t~ret0|=7] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] assume true; VAL [id_~x=8, |id_#in~x|=8, |id_#res|=8] [?] RET #32#return; VAL [id_~x=9, |id_#in~x|=9, |id_#t~ret0|=8] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] assume true; VAL [id_~x=9, |id_#in~x|=9, |id_#res|=9] [?] RET #32#return; VAL [id_~x=10, |id_#in~x|=10, |id_#t~ret0|=9] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] assume true; VAL [id_~x=10, |id_#in~x|=10, |id_#res|=10] [?] RET #32#return; VAL [id_~x=11, |id_#in~x|=11, |id_#t~ret0|=10] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=11, |id_#in~x|=11, |id_#res|=11] [?] assume true; VAL [id_~x=11, |id_#in~x|=11, |id_#res|=11] [?] RET #32#return; VAL [id_~x=12, |id_#in~x|=12, |id_#t~ret0|=11] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=12, |id_#in~x|=12, |id_#res|=12] [?] assume true; VAL [id_~x=12, |id_#in~x|=12, |id_#res|=12] [?] RET #32#return; VAL [id_~x=13, |id_#in~x|=13, |id_#t~ret0|=12] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=13, |id_#in~x|=13, |id_#res|=13] [?] assume true; VAL [id_~x=13, |id_#in~x|=13, |id_#res|=13] [?] RET #32#return; VAL [id_~x=14, |id_#in~x|=14, |id_#t~ret0|=13] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=14, |id_#in~x|=14, |id_#res|=14] [?] assume true; VAL [id_~x=14, |id_#in~x|=14, |id_#res|=14] [?] RET #32#return; VAL [id_~x=15, |id_#in~x|=15, |id_#t~ret0|=14] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=15, |id_#in~x|=15, |id_#res|=15] [?] assume true; VAL [id_~x=15, |id_#in~x|=15, |id_#res|=15] [?] RET #32#return; VAL [id_~x=16, |id_#in~x|=16, |id_#t~ret0|=15] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=16, |id_#in~x|=16, |id_#res|=16] [?] assume true; VAL [id_~x=16, |id_#in~x|=16, |id_#res|=16] [?] RET #32#return; VAL [id_~x=17, |id_#in~x|=17, |id_#t~ret0|=16] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=17, |id_#in~x|=17, |id_#res|=17] [?] assume true; VAL [id_~x=17, |id_#in~x|=17, |id_#res|=17] [?] RET #32#return; VAL [id_~x=18, |id_#in~x|=18, |id_#t~ret0|=17] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=18, |id_#in~x|=18, |id_#res|=18] [?] assume true; VAL [id_~x=18, |id_#in~x|=18, |id_#res|=18] [?] RET #32#return; VAL [id_~x=19, |id_#in~x|=19, |id_#t~ret0|=18] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=19, |id_#in~x|=19, |id_#res|=19] [?] assume true; VAL [id_~x=19, |id_#in~x|=19, |id_#res|=19] [?] RET #32#return; VAL [id_~x=20, |id_#in~x|=20, |id_#t~ret0|=19] [?] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;#res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=20, |id_#in~x|=20, |id_#res|=20] [?] assume true; VAL [id_~x=20, |id_#in~x|=20, |id_#res|=20] [?] RET #30#return; VAL [main_~input~0=20, |main_#t~ret1|=20] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=20, main_~result~0=20] [?] assume 20 == ~result~0; VAL [main_~input~0=20, main_~result~0=20] [?] assume !false; VAL [main_~input~0=20, main_~result~0=20] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] assume !(0 == ~x); VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] assume !(0 == ~x); VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] assume !(0 == ~x); VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] assume !(0 == ~x); VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] assume !(0 == ~x); VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] assume !(0 == ~x); VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] assume !(0 == ~x); VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] assume !(0 == ~x); VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] assume !(0 == ~x); VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] assume !(0 == ~x); VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L4-L7] ensures true; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L4-L7] ensures true; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L4-L7] ensures true; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L4-L7] ensures true; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L4-L7] ensures true; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L4-L7] ensures true; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L4-L7] ensures true; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L4-L7] ensures true; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L4-L7] ensures true; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L4-L7] ensures true; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12-L14] assume 20 == ~result~0; VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- 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 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] assume !(0 == ~x); VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] assume !(0 == ~x); VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] assume !(0 == ~x); VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] assume !(0 == ~x); VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] assume !(0 == ~x); VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] assume !(0 == ~x); VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] assume !(0 == ~x); VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] assume !(0 == ~x); VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] assume !(0 == ~x); VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] assume !(0 == ~x); VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] assume !(0 == ~x); VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] assume !(0 == ~x); VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] assume !(0 == ~x); VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] assume !(0 == ~x); VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] assume !(0 == ~x); VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L4-L7] ensures true; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L4-L7] ensures true; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L4-L7] ensures true; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L4-L7] ensures true; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L4-L7] ensures true; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L4-L7] ensures true; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L4-L7] ensures true; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L4-L7] ensures true; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L4-L7] ensures true; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L4-L7] ensures true; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L4-L7] ensures true; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L4-L7] ensures true; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L4-L7] ensures true; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L4-L7] ensures true; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L4-L7] ensures true; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12-L14] assume 20 == ~result~0; VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- 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 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] ----- ----- 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 := 20; VAL [~input~0=20] [L11] CALL call #t~ret1 := id(~input~0); VAL [#in~x=20] [L4-L7] ~x := #in~x; VAL [#in~x=20, ~x=20] [L5] COND FALSE !(0 == ~x) VAL [#in~x=20, ~x=20] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=19] [L4-L7] ~x := #in~x; VAL [#in~x=19, ~x=19] [L5] COND FALSE !(0 == ~x) VAL [#in~x=19, ~x=19] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=18] [L4-L7] ~x := #in~x; VAL [#in~x=18, ~x=18] [L5] COND FALSE !(0 == ~x) VAL [#in~x=18, ~x=18] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=17] [L4-L7] ~x := #in~x; VAL [#in~x=17, ~x=17] [L5] COND FALSE !(0 == ~x) VAL [#in~x=17, ~x=17] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=16] [L4-L7] ~x := #in~x; VAL [#in~x=16, ~x=16] [L5] COND FALSE !(0 == ~x) VAL [#in~x=16, ~x=16] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=15] [L4-L7] ~x := #in~x; VAL [#in~x=15, ~x=15] [L5] COND FALSE !(0 == ~x) VAL [#in~x=15, ~x=15] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=14] [L4-L7] ~x := #in~x; VAL [#in~x=14, ~x=14] [L5] COND FALSE !(0 == ~x) VAL [#in~x=14, ~x=14] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=13] [L4-L7] ~x := #in~x; VAL [#in~x=13, ~x=13] [L5] COND FALSE !(0 == ~x) VAL [#in~x=13, ~x=13] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=12] [L4-L7] ~x := #in~x; VAL [#in~x=12, ~x=12] [L5] COND FALSE !(0 == ~x) VAL [#in~x=12, ~x=12] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=11] [L4-L7] ~x := #in~x; VAL [#in~x=11, ~x=11] [L5] COND FALSE !(0 == ~x) VAL [#in~x=11, ~x=11] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=10] [L4-L7] ~x := #in~x; VAL [#in~x=10, ~x=10] [L5] COND FALSE !(0 == ~x) VAL [#in~x=10, ~x=10] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=9] [L4-L7] ~x := #in~x; VAL [#in~x=9, ~x=9] [L5] COND FALSE !(0 == ~x) VAL [#in~x=9, ~x=9] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=8] [L4-L7] ~x := #in~x; VAL [#in~x=8, ~x=8] [L5] COND FALSE !(0 == ~x) VAL [#in~x=8, ~x=8] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=7] [L4-L7] ~x := #in~x; VAL [#in~x=7, ~x=7] [L5] COND FALSE !(0 == ~x) VAL [#in~x=7, ~x=7] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=6] [L4-L7] ~x := #in~x; VAL [#in~x=6, ~x=6] [L5] COND FALSE !(0 == ~x) VAL [#in~x=6, ~x=6] [L6] CALL call #t~ret0 := id(~x - 1); 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] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=6, #t~ret0=5, ~x=6] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=6, #res=6, ~x=6] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=7, #t~ret0=6, ~x=7] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=7, #res=7, ~x=7] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=8, #t~ret0=7, ~x=8] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=8, #res=8, ~x=8] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=9, #t~ret0=8, ~x=9] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=9, #res=9, ~x=9] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=10, #t~ret0=9, ~x=10] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=10, #res=10, ~x=10] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=11, #t~ret0=10, ~x=11] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=11, #res=11, ~x=11] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=12, #t~ret0=11, ~x=12] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=12, #res=12, ~x=12] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=13, #t~ret0=12, ~x=13] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=13, #res=13, ~x=13] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=14, #t~ret0=13, ~x=14] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=14, #res=14, ~x=14] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=15, #t~ret0=14, ~x=15] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=15, #res=15, ~x=15] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=16, #t~ret0=15, ~x=16] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=16, #res=16, ~x=16] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=17, #t~ret0=16, ~x=17] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=17, #res=17, ~x=17] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=18, #t~ret0=17, ~x=18] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=18, #res=18, ~x=18] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=19, #t~ret0=18, ~x=19] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=19, #res=19, ~x=19] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=20, #t~ret0=19, ~x=20] [L6] assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647; [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=20, #res=20, ~x=20] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=20, ~input~0=20] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=20, ~result~0=20] [L12] COND TRUE 20 == ~result~0 VAL [~input~0=20, ~result~0=20] [L13] assert false; VAL [~input~0=20, ~result~0=20] [L10] int input = 20; VAL [input=20] [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) 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; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] ----- [2018-11-22 23:53:19,510 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8b7975b2-b790-49bf-9f7e-c9026668faf8/bin-2019/uautomizer/witness.graphml [2018-11-22 23:53:19,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:53:19,511 INFO L168 Benchmark]: Toolchain (without parser) took 13573.54 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 404.8 MB). Free memory was 953.8 MB in the beginning and 840.2 MB in the end (delta: 113.5 MB). Peak memory consumption was 518.3 MB. Max. memory is 11.5 GB. [2018-11-22 23:53:19,512 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:53:19,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.94 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 942.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:53:19,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.58 ms. Allocated memory is still 1.0 GB. Free memory is still 942.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:53:19,513 INFO L168 Benchmark]: Boogie Preprocessor took 11.59 ms. Allocated memory is still 1.0 GB. Free memory was 942.8 MB in the beginning and 940.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:53:19,513 INFO L168 Benchmark]: RCFGBuilder took 181.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-22 23:53:19,514 INFO L168 Benchmark]: TraceAbstraction took 12622.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 840.2 MB in the end (delta: 297.4 MB). Peak memory consumption was 548.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:53:19,514 INFO L168 Benchmark]: Witness Printer took 581.29 ms. Allocated memory is still 1.4 GB. Free memory was 840.2 MB in the beginning and 840.2 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-22 23:53:19,516 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 159.94 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 942.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.58 ms. Allocated memory is still 1.0 GB. Free memory is still 942.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.59 ms. Allocated memory is still 1.0 GB. Free memory was 942.8 MB in the beginning and 940.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 181.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 940.2 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12622.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 251.1 MB). Free memory was 1.1 GB in the beginning and 840.2 MB in the end (delta: 297.4 MB). Peak memory consumption was 548.6 MB. Max. memory is 11.5 GB. * Witness Printer took 581.29 ms. Allocated memory is still 1.4 GB. Free memory was 840.2 MB in the beginning and 840.2 MB in the end (delta: 24 B). Peak memory consumption was 24 B. 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 = 20; VAL [input=20] [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) 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; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) VAL [id(input)=20, input=20] [L11] int result = id(input); [L12] COND TRUE result == 20 VAL [input=20, result=20] [L13] __VERIFIER_error() VAL [input=20, result=20] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 12.5s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 5.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 261 SDtfs, 347 SDslu, 3966 SDs, 0 SdLazy, 2237 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2150 GetRequests, 1321 SyntacticMatches, 0 SemanticMatches, 829 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9629 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=20, 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, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2920 NumberOfCodeBlocks, 2920 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2748 ConstructedInterpolants, 0 QuantifiedInterpolants, 547176 SizeOfPredicates, 158 NumberOfNonLiveVariables, 3268 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...