./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_i15_o15_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_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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 ad4e6ad99a266ddeead98987e8e44db723af5bc7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:29:34,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:29:34,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:29:34,735 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:29:34,735 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:29:34,736 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:29:34,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:29:34,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:29:34,739 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:29:34,740 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:29:34,740 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:29:34,740 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:29:34,741 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:29:34,742 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:29:34,743 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:29:34,743 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:29:34,744 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:29:34,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:29:34,746 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:29:34,747 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:29:34,748 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:29:34,749 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:29:34,751 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:29:34,751 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:29:34,751 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:29:34,751 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:29:34,752 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:29:34,753 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:29:34,753 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:29:34,754 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:29:34,754 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:29:34,755 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:29:34,755 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:29:34,755 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:29:34,755 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:29:34,756 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:29:34,756 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 00:29:34,766 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:29:34,766 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:29:34,767 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 00:29:34,767 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 00:29:34,767 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:29:34,768 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:29:34,768 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:29:34,768 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:29:34,768 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:29:34,768 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:29:34,768 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:29:34,768 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:29:34,769 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 00:29:34,769 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 00:29:34,769 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 00:29:34,769 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:29:34,769 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:29:34,769 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:29:34,769 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 00:29:34,770 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:29:34,770 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:29:34,770 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 00:29:34,770 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 00:29:34,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:29:34,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:29:34,770 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 00:29:34,771 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 00:29:34,771 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:29:34,771 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 00:29:34,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 00:29:34,771 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_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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 -> ad4e6ad99a266ddeead98987e8e44db723af5bc7 [2018-11-23 00:29:34,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:29:34,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:29:34,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:29:34,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:29:34,807 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:29:34,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c [2018-11-23 00:29:34,851 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/data/2827e750a/feb0d2ef252949538a7afc6b0704f08d/FLAGc5993dab7 [2018-11-23 00:29:35,243 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:29:35,243 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/sv-benchmarks/c/recursive-simple/id_i15_o15_false-unreach-call_true-termination.c [2018-11-23 00:29:35,246 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/data/2827e750a/feb0d2ef252949538a7afc6b0704f08d/FLAGc5993dab7 [2018-11-23 00:29:35,255 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/data/2827e750a/feb0d2ef252949538a7afc6b0704f08d [2018-11-23 00:29:35,257 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:29:35,258 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:29:35,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:29:35,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:29:35,261 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:29:35,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74c2c8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35, skipping insertion in model container [2018-11-23 00:29:35,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,269 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:29:35,279 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:29:35,380 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:29:35,382 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:29:35,390 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:29:35,398 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:29:35,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35 WrapperNode [2018-11-23 00:29:35,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:29:35,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:29:35,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:29:35,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:29:35,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:29:35,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:29:35,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:29:35,411 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:29:35,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... [2018-11-23 00:29:35,421 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:29:35,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:29:35,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:29:35,422 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:29:35,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 00:29:35,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 00:29:35,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 00:29:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:29:35,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:29:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 00:29:35,501 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 00:29:35,501 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 00:29:35,501 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 00:29:35,593 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:29:35,593 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 00:29:35,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:29:35 BoogieIcfgContainer [2018-11-23 00:29:35,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:29:35,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 00:29:35,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 00:29:35,596 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 00:29:35,596 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:29:35" (1/3) ... [2018-11-23 00:29:35,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fcbbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:29:35, skipping insertion in model container [2018-11-23 00:29:35,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:29:35" (2/3) ... [2018-11-23 00:29:35,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fcbbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:29:35, skipping insertion in model container [2018-11-23 00:29:35,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:29:35" (3/3) ... [2018-11-23 00:29:35,599 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i15_o15_false-unreach-call_true-termination.c [2018-11-23 00:29:35,605 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 00:29:35,609 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 00:29:35,619 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 00:29:35,638 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:29:35,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 00:29:35,639 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 00:29:35,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 00:29:35,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:29:35,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:29:35,639 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 00:29:35,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:29:35,639 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 00:29:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 00:29:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 00:29:35,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:35,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:35,657 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:35,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-23 00:29:35,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:35,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:35,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:29:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:29:35,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:29:35,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:29:35,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 00:29:35,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:29:35,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:29:35,789 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 00:29:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:35,837 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-23 00:29:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:29:35,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 00:29:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:35,843 INFO L225 Difference]: With dead ends: 30 [2018-11-23 00:29:35,844 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 00:29:35,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:29:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 00:29:35,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 00:29:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 00:29:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 00:29:35,871 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 00:29:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:35,872 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 00:29:35,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 00:29:35,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 00:29:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 00:29:35,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:35,873 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:35,873 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:35,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-23 00:29:35,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:35,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:35,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:35,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:29:35,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 00:29:35,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:35,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:29:35,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:29:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:35,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 00:29:35,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:35,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 00:29:35,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 00:29:35,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:29:35,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:29:35,983 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 6 states. [2018-11-23 00:29:36,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:36,041 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 00:29:36,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 00:29:36,042 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 00:29:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:36,043 INFO L225 Difference]: With dead ends: 25 [2018-11-23 00:29:36,043 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 00:29:36,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:29:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 00:29:36,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 00:29:36,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 00:29:36,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 00:29:36,048 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 00:29:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:36,048 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 00:29:36,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 00:29:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 00:29:36,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 00:29:36,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:36,049 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:36,050 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:36,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-23 00:29:36,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:36,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:29:36,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 00:29:36,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:36,135 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:29:36,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:29:36,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:29:36,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:36,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:36,178 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 00:29:36,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:36,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 00:29:36,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 00:29:36,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:29:36,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:29:36,193 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-23 00:29:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:36,233 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 00:29:36,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:29:36,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 00:29:36,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:36,234 INFO L225 Difference]: With dead ends: 28 [2018-11-23 00:29:36,234 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 00:29:36,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:29:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 00:29:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 00:29:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 00:29:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 00:29:36,237 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 00:29:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:36,237 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 00:29:36,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 00:29:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 00:29:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 00:29:36,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:36,238 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:36,238 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:36,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-23 00:29:36,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:36,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 00:29:36,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:36,321 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:29:36,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:29:36,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 00:29:36,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:36,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:36,370 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 00:29:36,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:36,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 00:29:36,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 00:29:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 00:29:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:29:36,385 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 11 states. [2018-11-23 00:29:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:36,412 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 00:29:36,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:29:36,412 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-11-23 00:29:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:36,413 INFO L225 Difference]: With dead ends: 31 [2018-11-23 00:29:36,413 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 00:29:36,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-23 00:29:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 00:29:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 00:29:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 00:29:36,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 00:29:36,416 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2018-11-23 00:29:36,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:36,417 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 00:29:36,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 00:29:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 00:29:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 00:29:36,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:36,418 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:36,418 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:36,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1080764669, now seen corresponding path program 4 times [2018-11-23 00:29:36,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:36,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:36,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:36,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 00:29:36,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:36,476 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:29:36,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:29:36,491 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:29:36,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:36,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:36,506 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-23 00:29:36,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:36,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 00:29:36,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 00:29:36,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:29:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-23 00:29:36,532 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2018-11-23 00:29:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:36,591 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 00:29:36,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:29:36,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 00:29:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:36,594 INFO L225 Difference]: With dead ends: 34 [2018-11-23 00:29:36,594 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 00:29:36,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:29:36,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 00:29:36,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 00:29:36,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 00:29:36,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 00:29:36,600 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2018-11-23 00:29:36,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:36,600 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 00:29:36,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 00:29:36,600 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 00:29:36,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 00:29:36,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:36,601 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:36,602 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:36,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:36,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1752970513, now seen corresponding path program 5 times [2018-11-23 00:29:36,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:36,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:36,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:36,715 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-23 00:29:36,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:36,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:36,721 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 00:29:36,753 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 00:29:36,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:36,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:36,766 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-23 00:29:36,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:36,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 00:29:36,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 00:29:36,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 00:29:36,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-23 00:29:36,782 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2018-11-23 00:29:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:36,816 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 00:29:36,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 00:29:36,817 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-11-23 00:29:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:36,818 INFO L225 Difference]: With dead ends: 37 [2018-11-23 00:29:36,818 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 00:29:36,819 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-23 00:29:36,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 00:29:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 00:29:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 00:29:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 00:29:36,823 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2018-11-23 00:29:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:36,824 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 00:29:36,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 00:29:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 00:29:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 00:29:36,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:36,825 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:36,825 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:36,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:36,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1590630787, now seen corresponding path program 6 times [2018-11-23 00:29:36,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:36,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:36,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:36,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:36,951 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-23 00:29:36,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:36,952 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:36,959 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 00:29:36,974 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 00:29:36,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:36,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:37,085 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-23 00:29:37,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:37,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11] total 26 [2018-11-23 00:29:37,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 00:29:37,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 00:29:37,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2018-11-23 00:29:37,100 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 26 states. [2018-11-23 00:29:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:37,317 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 00:29:37,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 00:29:37,317 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-11-23 00:29:37,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:37,318 INFO L225 Difference]: With dead ends: 40 [2018-11-23 00:29:37,318 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 00:29:37,319 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-23 00:29:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 00:29:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 00:29:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 00:29:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 00:29:37,322 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2018-11-23 00:29:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:37,323 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 00:29:37,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 00:29:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 00:29:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 00:29:37,324 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:37,324 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:37,324 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:37,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1532150511, now seen corresponding path program 7 times [2018-11-23 00:29:37,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:37,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:37,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:37,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:37,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:37,452 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-23 00:29:37,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:37,452 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:37,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:29:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:37,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:37,570 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-23 00:29:37,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:37,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2018-11-23 00:29:37,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 00:29:37,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 00:29:37,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2018-11-23 00:29:37,585 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 29 states. [2018-11-23 00:29:37,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:37,843 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 00:29:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 00:29:37,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-11-23 00:29:37,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:37,844 INFO L225 Difference]: With dead ends: 43 [2018-11-23 00:29:37,844 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 00:29:37,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=1538, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 00:29:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 00:29:37,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 00:29:37,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 00:29:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 00:29:37,850 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2018-11-23 00:29:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:37,852 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 00:29:37,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 00:29:37,852 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 00:29:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 00:29:37,853 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:37,853 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:37,853 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:37,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:37,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1140618237, now seen corresponding path program 8 times [2018-11-23 00:29:37,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:37,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:37,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:37,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:29:37,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:37,950 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-23 00:29:37,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:37,950 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:37,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:29:37,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:29:37,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:37,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:37,991 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-23 00:29:38,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:38,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 00:29:38,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 00:29:38,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 00:29:38,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-11-23 00:29:38,006 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 13 states. [2018-11-23 00:29:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:38,069 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 00:29:38,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 00:29:38,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2018-11-23 00:29:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:38,072 INFO L225 Difference]: With dead ends: 46 [2018-11-23 00:29:38,072 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 00:29:38,072 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-23 00:29:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 00:29:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 00:29:38,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 00:29:38,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 00:29:38,075 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2018-11-23 00:29:38,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:38,075 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 00:29:38,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 00:29:38,076 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 00:29:38,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 00:29:38,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:38,076 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:38,077 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:38,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:38,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1749177617, now seen corresponding path program 9 times [2018-11-23 00:29:38,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:38,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:38,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:38,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:38,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:38,169 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-23 00:29:38,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:38,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:38,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:29:38,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 00:29:38,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:38,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:38,425 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-23 00:29:38,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:38,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2018-11-23 00:29:38,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 00:29:38,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 00:29:38,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 00:29:38,440 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 35 states. [2018-11-23 00:29:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:38,720 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 00:29:38,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 00:29:38,721 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-11-23 00:29:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:38,721 INFO L225 Difference]: With dead ends: 49 [2018-11-23 00:29:38,722 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 00:29:38,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=531, Invalid=2331, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 00:29:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 00:29:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 00:29:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 00:29:38,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 00:29:38,727 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2018-11-23 00:29:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:38,728 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 00:29:38,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 00:29:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 00:29:38,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 00:29:38,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:38,729 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:38,729 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:38,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:38,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1580609155, now seen corresponding path program 10 times [2018-11-23 00:29:38,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:38,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:38,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:38,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:38,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:38,833 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-23 00:29:38,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:38,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:38,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 00:29:38,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 00:29:38,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:38,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:38,866 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-23 00:29:38,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:38,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 00:29:38,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 00:29:38,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 00:29:38,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2018-11-23 00:29:38,881 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2018-11-23 00:29:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:38,990 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 00:29:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 00:29:38,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 73 [2018-11-23 00:29:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:38,991 INFO L225 Difference]: With dead ends: 52 [2018-11-23 00:29:38,991 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 00:29:38,992 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-23 00:29:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 00:29:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 00:29:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 00:29:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 00:29:38,997 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2018-11-23 00:29:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:38,998 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 00:29:38,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 00:29:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 00:29:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 00:29:38,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:38,998 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:38,999 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:38,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash -223837457, now seen corresponding path program 11 times [2018-11-23 00:29:38,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:38,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:38,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:39,099 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-23 00:29:39,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:39,100 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:39,105 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 00:29:39,122 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 00:29:39,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:39,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:39,139 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-23 00:29:39,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:39,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-23 00:29:39,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 00:29:39,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 00:29:39,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2018-11-23 00:29:39,159 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 16 states. [2018-11-23 00:29:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:39,302 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 00:29:39,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 00:29:39,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 79 [2018-11-23 00:29:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:39,304 INFO L225 Difference]: With dead ends: 55 [2018-11-23 00:29:39,304 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 00:29:39,305 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-23 00:29:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 00:29:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 00:29:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 00:29:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 00:29:39,310 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2018-11-23 00:29:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:39,310 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 00:29:39,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 00:29:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 00:29:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 00:29:39,310 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:39,311 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:39,311 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:39,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:39,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1653931773, now seen corresponding path program 12 times [2018-11-23 00:29:39,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:39,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:39,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:39,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:39,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:39,488 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-23 00:29:39,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:39,489 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:39,496 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 00:29:39,518 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 00:29:39,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:39,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:39,533 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-23 00:29:39,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:39,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-23 00:29:39,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 00:29:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 00:29:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-11-23 00:29:39,549 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 29 states. [2018-11-23 00:29:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:39,588 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 00:29:39,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 00:29:39,589 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-11-23 00:29:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:39,589 INFO L225 Difference]: With dead ends: 58 [2018-11-23 00:29:39,589 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 00:29:39,590 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-23 00:29:39,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 00:29:39,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 00:29:39,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 00:29:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 00:29:39,593 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2018-11-23 00:29:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:39,594 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 00:29:39,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 00:29:39,594 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 00:29:39,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 00:29:39,595 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:39,595 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:39,595 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:39,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:39,595 INFO L82 PathProgramCache]: Analyzing trace with hash -218674449, now seen corresponding path program 13 times [2018-11-23 00:29:39,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:39,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:39,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:39,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:39,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:39,797 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-23 00:29:39,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:39,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:39,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:29:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:39,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:40,069 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-23 00:29:40,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:40,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18] total 47 [2018-11-23 00:29:40,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 00:29:40,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 00:29:40,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 00:29:40,094 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 47 states. [2018-11-23 00:29:40,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:40,544 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 00:29:40,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 00:29:40,545 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2018-11-23 00:29:40,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:40,546 INFO L225 Difference]: With dead ends: 61 [2018-11-23 00:29:40,546 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 00:29:40,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=993, Invalid=4409, Unknown=0, NotChecked=0, Total=5402 [2018-11-23 00:29:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 00:29:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 00:29:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 00:29:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 00:29:40,554 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2018-11-23 00:29:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:40,555 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 00:29:40,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 00:29:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 00:29:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 00:29:40,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:40,556 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:40,556 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:40,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash 492436605, now seen corresponding path program 14 times [2018-11-23 00:29:40,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:40,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:40,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:40,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:29:40,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:29:40,839 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-23 00:29:40,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:29:40,840 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/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-23 00:29:40,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:29:40,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 00:29:40,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:29:40,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:29:41,116 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-23 00:29:41,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:29:41,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2018-11-23 00:29:41,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 00:29:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 00:29:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2052, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 00:29:41,132 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 50 states. [2018-11-23 00:29:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:29:41,593 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-23 00:29:41,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 00:29:41,593 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2018-11-23 00:29:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 00:29:41,593 INFO L225 Difference]: With dead ends: 64 [2018-11-23 00:29:41,593 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 00:29:41,594 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-23 00:29:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 00:29:41,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 00:29:41,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 00:29:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 00:29:41,597 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2018-11-23 00:29:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 00:29:41,597 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 00:29:41,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 00:29:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 00:29:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-23 00:29:41,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 00:29:41,598 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:29:41,598 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 00:29:41,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:29:41,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1083048687, now seen corresponding path program 15 times [2018-11-23 00:29:41,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:29:41,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:29:41,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:41,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:29:41,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:29:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:29:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:29:41,630 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 := 15; VAL [main_~input~0=15] [?] CALL call #t~ret1 := id(~input~0); 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 #30#return; VAL [main_~input~0=15, |main_#t~ret1|=15] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=15, main_~result~0=15] [?] assume 15 == ~result~0; VAL [main_~input~0=15, main_~result~0=15] [?] assume !false; VAL [main_~input~0=15, main_~result~0=15] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12-L14] assume 15 == ~result~0; VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] ----- ----- 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 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12-L14] assume 15 == ~result~0; VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12] COND TRUE 15 == ~result~0 VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] ----- ----- 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 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12] COND TRUE 15 == ~result~0 VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12] COND TRUE 15 == ~result~0 VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] ----- ----- 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 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12] COND TRUE 15 == ~result~0 VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] [L10] int input = 15; VAL [input=15] [L11] CALL, EXPR id(input) 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; [L11] RET, EXPR id(input) VAL [id(input)=15, input=15] [L11] int result = id(input); [L12] COND TRUE result == 15 VAL [input=15, result=15] [L13] __VERIFIER_error() VAL [input=15, result=15] ----- [2018-11-23 00:29:41,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:29:41 BoogieIcfgContainer [2018-11-23 00:29:41,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 00:29:41,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:29:41,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:29:41,738 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:29:41,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:29:35" (3/4) ... [2018-11-23 00:29:41,740 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 := 15; VAL [main_~input~0=15] [?] CALL call #t~ret1 := id(~input~0); 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 #30#return; VAL [main_~input~0=15, |main_#t~ret1|=15] [?] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647;~result~0 := #t~ret1;havoc #t~ret1; VAL [main_~input~0=15, main_~result~0=15] [?] assume 15 == ~result~0; VAL [main_~input~0=15, main_~result~0=15] [?] assume !false; VAL [main_~input~0=15, main_~result~0=15] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12-L14] assume 15 == ~result~0; VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] ----- ----- 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 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12-L14] assume 15 == ~result~0; VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12] COND TRUE 15 == ~result~0 VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] ----- ----- 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 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12] COND TRUE 15 == ~result~0 VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L10] ~input~0 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12] COND TRUE 15 == ~result~0 VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] ----- ----- 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 := 15; VAL [~input~0=15] [L11] CALL call #t~ret1 := id(~input~0); 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] [L11] RET call #t~ret1 := id(~input~0); VAL [#t~ret1=15, ~input~0=15] [L11] assume -2147483648 <= #t~ret1 && #t~ret1 <= 2147483647; [L11] ~result~0 := #t~ret1; [L11] havoc #t~ret1; VAL [~input~0=15, ~result~0=15] [L12] COND TRUE 15 == ~result~0 VAL [~input~0=15, ~result~0=15] [L13] assert false; VAL [~input~0=15, ~result~0=15] [L10] int input = 15; VAL [input=15] [L11] CALL, EXPR id(input) 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; [L11] RET, EXPR id(input) VAL [id(input)=15, input=15] [L11] int result = id(input); [L12] COND TRUE result == 15 VAL [input=15, result=15] [L13] __VERIFIER_error() VAL [input=15, result=15] ----- [2018-11-23 00:29:42,037 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0a2173f5-2d75-4b10-a6d4-4ea1de2fe5dd/bin-2019/uautomizer/witness.graphml [2018-11-23 00:29:42,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:29:42,038 INFO L168 Benchmark]: Toolchain (without parser) took 6780.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.0 MB). Free memory was 959.8 MB in the beginning and 1.3 GB in the end (delta: -355.1 MB). Peak memory consumption was 1.9 MB. Max. memory is 11.5 GB. [2018-11-23 00:29:42,039 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:29:42,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 140.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:29:42,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 949.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:29:42,040 INFO L168 Benchmark]: Boogie Preprocessor took 10.23 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:29:42,040 INFO L168 Benchmark]: RCFGBuilder took 172.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:29:42,040 INFO L168 Benchmark]: TraceAbstraction took 6143.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.5 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:29:42,041 INFO L168 Benchmark]: Witness Printer took 299.30 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2018-11-23 00:29:42,042 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 140.31 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.13 ms. Allocated memory is still 1.0 GB. Free memory is still 949.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.23 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 172.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6143.33 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.2 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.5 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Witness Printer took 299.30 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 15; VAL [input=15] [L11] CALL, EXPR id(input) 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; [L11] RET, EXPR id(input) VAL [id(input)=15, input=15] [L11] int result = id(input); [L12] COND TRUE result == 15 VAL [input=15, result=15] [L13] __VERIFIER_error() VAL [input=15, result=15] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 6.0s OverallTime, 16 OverallIterations, 16 TraceHistogramMax, 2.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 200 SDtfs, 208 SDslu, 2387 SDs, 0 SdLazy, 1194 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1229 GetRequests, 800 SyntacticMatches, 0 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3459 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=15, 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, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1740 NumberOfCodeBlocks, 1740 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 1608 ConstructedInterpolants, 0 QuantifiedInterpolants, 241800 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1918 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 29 InterpolantComputations, 1 PerfectInterpolantSequences, 3150/6300 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...