./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id2_b3_o2_false-unreach-call_true-termination_true-no-overflow.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_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/id2_b3_o2_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/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 a033d09eab07f8bc6e49bb4301ebd6c89110f535 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:46:05,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:46:05,299 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:46:05,305 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:46:05,306 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:46:05,307 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:46:05,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:46:05,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:46:05,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:46:05,310 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:46:05,311 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:46:05,311 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:46:05,312 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:46:05,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:46:05,313 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:46:05,314 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:46:05,314 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:46:05,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:46:05,317 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:46:05,317 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:46:05,318 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:46:05,319 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:46:05,321 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:46:05,321 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:46:05,321 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:46:05,322 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:46:05,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:46:05,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:46:05,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:46:05,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:46:05,324 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:46:05,324 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:46:05,325 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:46:05,325 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:46:05,325 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:46:05,326 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:46:05,326 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 02:46:05,333 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:46:05,333 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:46:05,334 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:46:05,334 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:46:05,335 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 02:46:05,335 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 02:46:05,335 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 02:46:05,335 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:46:05,335 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 02:46:05,335 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:46:05,336 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 02:46:05,336 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:46:05,336 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:46:05,336 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:46:05,336 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:46:05,336 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 02:46:05,336 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:46:05,337 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:46:05,337 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:46:05,337 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:46:05,337 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:46:05,337 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:46:05,337 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:46:05,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:46:05,338 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:46:05,338 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:46:05,338 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:46:05,338 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 02:46:05,338 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:46:05,338 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:46:05,338 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_1a9d3d47-4089-4781-9ef7-d71991c4adee/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 -> a033d09eab07f8bc6e49bb4301ebd6c89110f535 [2018-11-23 02:46:05,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:46:05,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:46:05,375 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:46:05,376 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:46:05,376 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:46:05,377 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/../../sv-benchmarks/c/recursive-simple/id2_b3_o2_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 02:46:05,417 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/data/39476d630/8243fdd88512479f86429b9cea691605/FLAG6e00b5419 [2018-11-23 02:46:05,753 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:46:05,753 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/sv-benchmarks/c/recursive-simple/id2_b3_o2_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 02:46:05,757 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/data/39476d630/8243fdd88512479f86429b9cea691605/FLAG6e00b5419 [2018-11-23 02:46:06,180 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/data/39476d630/8243fdd88512479f86429b9cea691605 [2018-11-23 02:46:06,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:46:06,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:46:06,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:46:06,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:46:06,189 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:46:06,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46704e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06, skipping insertion in model container [2018-11-23 02:46:06,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:46:06,218 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:46:06,333 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:46:06,335 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:46:06,346 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:46:06,354 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:46:06,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06 WrapperNode [2018-11-23 02:46:06,355 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:46:06,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:46:06,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:46:06,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:46:06,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,368 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:46:06,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:46:06,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:46:06,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:46:06,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... [2018-11-23 02:46:06,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:46:06,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:46:06,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:46:06,381 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:46:06,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/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 02:46:06,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:46:06,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:46:06,463 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2018-11-23 02:46:06,463 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2018-11-23 02:46:06,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:46:06,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:46:06,464 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:46:06,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:46:06,464 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 02:46:06,464 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 02:46:06,581 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:46:06,581 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 02:46:06,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:06 BoogieIcfgContainer [2018-11-23 02:46:06,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:46:06,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:46:06,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:46:06,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:46:06,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:46:06" (1/3) ... [2018-11-23 02:46:06,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131931c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:46:06, skipping insertion in model container [2018-11-23 02:46:06,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:46:06" (2/3) ... [2018-11-23 02:46:06,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131931c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:46:06, skipping insertion in model container [2018-11-23 02:46:06,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:06" (3/3) ... [2018-11-23 02:46:06,587 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b3_o2_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 02:46:06,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:46:06,602 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 02:46:06,612 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 02:46:06,635 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 02:46:06,636 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:46:06,636 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:46:06,636 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:46:06,636 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:46:06,636 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:46:06,636 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:46:06,637 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:46:06,637 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:46:06,652 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 02:46:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 02:46:06,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:46:06,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:46:06,659 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:46:06,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:46:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 128923731, now seen corresponding path program 1 times [2018-11-23 02:46:06,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:46:06,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:46:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:06,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:46:06,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:06,829 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 02:46:06,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:46:06,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:46:06,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:46:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:46:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:46:06,843 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2018-11-23 02:46:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:46:06,882 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 02:46:06,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:46:06,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 02:46:06,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:46:06,891 INFO L225 Difference]: With dead ends: 40 [2018-11-23 02:46:06,891 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 02:46:06,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:46:06,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 02:46:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 02:46:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 02:46:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 02:46:06,924 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 13 [2018-11-23 02:46:06,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:46:06,924 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 02:46:06,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:46:06,925 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 02:46:06,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:06,926 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:46:06,926 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:46:06,926 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:46:06,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:46:06,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1945633833, now seen corresponding path program 1 times [2018-11-23 02:46:06,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:46:06,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:46:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:06,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:46:06,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:06,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:07,019 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 02:46:07,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:46:07,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:46:07,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:46:07,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:46:07,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:46:07,021 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-23 02:46:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:46:07,055 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 02:46:07,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:46:07,055 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 02:46:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:46:07,056 INFO L225 Difference]: With dead ends: 44 [2018-11-23 02:46:07,056 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 02:46:07,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:46:07,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 02:46:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 02:46:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 02:46:07,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-23 02:46:07,062 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-23 02:46:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:46:07,063 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 02:46:07,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:46:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 02:46:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 02:46:07,064 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:46:07,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:46:07,064 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:46:07,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:46:07,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1974262984, now seen corresponding path program 1 times [2018-11-23 02:46:07,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:46:07,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:46:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:07,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:46:07,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:07,190 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 02:46:07,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:46:07,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 02:46:07,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:46:07,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:46:07,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 02:46:07,192 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-11-23 02:46:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:46:07,229 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 02:46:07,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:46:07,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 02:46:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:46:07,231 INFO L225 Difference]: With dead ends: 36 [2018-11-23 02:46:07,231 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 02:46:07,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:46:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 02:46:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 02:46:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 02:46:07,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-23 02:46:07,238 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2018-11-23 02:46:07,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:46:07,238 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 02:46:07,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:46:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 02:46:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:46:07,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:46:07,239 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:46:07,240 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:46:07,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:46:07,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1423155149, now seen corresponding path program 1 times [2018-11-23 02:46:07,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:46:07,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:46:07,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:07,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:46:07,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:07,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:46:07,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:46:07,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:46:07,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:46:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:46:07,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:46:07,304 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-11-23 02:46:07,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:46:07,318 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 02:46:07,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:46:07,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 02:46:07,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:46:07,319 INFO L225 Difference]: With dead ends: 48 [2018-11-23 02:46:07,319 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 02:46:07,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:46:07,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 02:46:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-23 02:46:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:46:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 02:46:07,324 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-23 02:46:07,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:46:07,325 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 02:46:07,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:46:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 02:46:07,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:46:07,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:46:07,326 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:46:07,326 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:46:07,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:46:07,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1226641644, now seen corresponding path program 1 times [2018-11-23 02:46:07,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:46:07,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:46:07,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:07,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:46:07,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:46:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 02:46:07,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:46:07,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 02:46:07,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:46:07,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:46:07,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:46:07,386 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-11-23 02:46:07,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:46:07,395 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-11-23 02:46:07,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:46:07,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-23 02:46:07,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:46:07,396 INFO L225 Difference]: With dead ends: 40 [2018-11-23 02:46:07,396 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 02:46:07,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 02:46:07,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 02:46:07,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-23 02:46:07,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 02:46:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-23 02:46:07,400 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2018-11-23 02:46:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:46:07,400 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-23 02:46:07,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:46:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 02:46:07,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 02:46:07,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:46:07,401 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:46:07,401 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 02:46:07,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:46:07,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1255270795, now seen corresponding path program 1 times [2018-11-23 02:46:07,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 02:46:07,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 02:46:07,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:07,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:46:07,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:46:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:46:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 02:46:07,438 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #44#return; [?] CALL call #t~ret4 := main(); [?] ~input~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~input~0=4294967298] [?] CALL call #t~ret3 := id(~input~0); VAL [|id_#in~x|=4294967298] [?] ~x := #in~x; VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=4294967297] [?] ~x := #in~x; VAL [id2_~x=4294967297, |id2_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id2_~x=4294967297, |id2_#in~x|=4294967297] [?] CALL call #t~ret1 := id(~x - 1); VAL [|id_#in~x|=4294967296] [?] ~x := #in~x; VAL [id_~x=4294967296, |id_#in~x|=4294967296] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] assume true; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] RET #42#return; VAL [id2_~x=4294967297, |id2_#in~x|=4294967297, |id2_#t~ret1|=0] [?] ~ret~1 := 1 + #t~ret1;havoc #t~ret1; VAL [id2_~ret~1=1, id2_~x=4294967297, |id2_#in~x|=4294967297] [?] assume !(~ret~1 % 4294967296 > 3);#res := ~ret~1; VAL [id2_~ret~1=1, id2_~x=4294967297, |id2_#in~x|=4294967297, |id2_#res|=1] [?] assume true; VAL [id2_~ret~1=1, id2_~x=4294967297, |id2_#in~x|=4294967297, |id2_#res|=1] [?] RET #50#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] ~ret~0 := 1 + #t~ret0;havoc #t~ret0; VAL [id_~ret~0=2, id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(~ret~0 % 4294967296 > 3);#res := ~ret~0; VAL [id_~ret~0=2, id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~ret~0=2, id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #48#return; VAL [main_~input~0=4294967298, |main_#t~ret3|=2] [?] ~result~0 := #t~ret3;havoc #t~ret3; VAL [main_~input~0=4294967298, main_~result~0=2] [?] assume 2 == ~result~0 % 4294967296; VAL [main_~input~0=4294967298, main_~result~0=2] [?] assume !false; VAL [main_~input~0=4294967298, main_~result~0=2] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] assume 0 == ~x % 4294967296; [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] assume !(~ret~1 % 4294967296 > 3); [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L5] ensures true; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] assume !(~ret~0 % 4294967296 > 3); [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L4] ensures true; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24-L26] assume 2 == ~result~0 % 4294967296; VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] assume 0 == ~x % 4294967296; [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] assume !(~ret~1 % 4294967296 > 3); [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L5] ensures true; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] assume !(~ret~0 % 4294967296 > 3); [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L4] ensures true; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24-L26] assume 2 == ~result~0 % 4294967296; VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24] COND TRUE 2 == ~result~0 % 4294967296 VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24] COND TRUE 2 == ~result~0 % 4294967296 VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24] COND TRUE 2 == ~result~0 % 4294967296 VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24] COND TRUE 2 == ~result~0 % 4294967296 VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] [L22] unsigned int input = __VERIFIER_nondet_uint(); [L23] CALL, EXPR id(input) VAL [\old(x)=2] [L8] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=1] [L15] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L16] CALL, EXPR id(x-1) VAL [\old(x)=0] [L8] COND TRUE x==0 [L8] return 0; VAL [\old(x)=0, \result=0, x=0] [L16] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L16] unsigned int ret = id(x-1) + 1; [L17] COND FALSE !(ret > 3) [L18] return ret; VAL [\old(x)=1, \result=1, ret=1, x=1] [L9] RET, EXPR id2(x-1) VAL [\old(x)=2, id2(x-1)=1, x=2] [L9] unsigned int ret = id2(x-1) + 1; [L10] COND FALSE !(ret > 3) [L11] return ret; VAL [\old(x)=2, \result=2, ret=2, x=2] [L23] RET, EXPR id(input) VAL [id(input)=2, input=2] [L23] unsigned int result = id(input); [L24] COND TRUE result == 2 VAL [input=2, result=2] [L25] __VERIFIER_error() VAL [input=2, result=2] ----- [2018-11-23 02:46:07,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:46:07 BoogieIcfgContainer [2018-11-23 02:46:07,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 02:46:07,467 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 02:46:07,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 02:46:07,467 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 02:46:07,468 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:46:06" (3/4) ... [2018-11-23 02:46:07,469 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 #44#return; [?] CALL call #t~ret4 := main(); [?] ~input~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~input~0=4294967298] [?] CALL call #t~ret3 := id(~input~0); VAL [|id_#in~x|=4294967298] [?] ~x := #in~x; VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967298, |id_#in~x|=4294967298] [?] CALL call #t~ret0 := id2(~x - 1); VAL [|id2_#in~x|=4294967297] [?] ~x := #in~x; VAL [id2_~x=4294967297, |id2_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id2_~x=4294967297, |id2_#in~x|=4294967297] [?] CALL call #t~ret1 := id(~x - 1); VAL [|id_#in~x|=4294967296] [?] ~x := #in~x; VAL [id_~x=4294967296, |id_#in~x|=4294967296] [?] assume 0 == ~x % 4294967296;#res := 0; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] assume true; VAL [id_~x=4294967296, |id_#in~x|=4294967296, |id_#res|=0] [?] RET #42#return; VAL [id2_~x=4294967297, |id2_#in~x|=4294967297, |id2_#t~ret1|=0] [?] ~ret~1 := 1 + #t~ret1;havoc #t~ret1; VAL [id2_~ret~1=1, id2_~x=4294967297, |id2_#in~x|=4294967297] [?] assume !(~ret~1 % 4294967296 > 3);#res := ~ret~1; VAL [id2_~ret~1=1, id2_~x=4294967297, |id2_#in~x|=4294967297, |id2_#res|=1] [?] assume true; VAL [id2_~ret~1=1, id2_~x=4294967297, |id2_#in~x|=4294967297, |id2_#res|=1] [?] RET #50#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] ~ret~0 := 1 + #t~ret0;havoc #t~ret0; VAL [id_~ret~0=2, id_~x=4294967298, |id_#in~x|=4294967298] [?] assume !(~ret~0 % 4294967296 > 3);#res := ~ret~0; VAL [id_~ret~0=2, id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~ret~0=2, id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #48#return; VAL [main_~input~0=4294967298, |main_#t~ret3|=2] [?] ~result~0 := #t~ret3;havoc #t~ret3; VAL [main_~input~0=4294967298, main_~result~0=2] [?] assume 2 == ~result~0 % 4294967296; VAL [main_~input~0=4294967298, main_~result~0=2] [?] assume !false; VAL [main_~input~0=4294967298, main_~result~0=2] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] assume 0 == ~x % 4294967296; [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] assume !(~ret~1 % 4294967296 > 3); [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L5] ensures true; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] assume !(~ret~0 % 4294967296 > 3); [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L4] ensures true; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24-L26] assume 2 == ~result~0 % 4294967296; VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] assume 0 == ~x % 4294967296; [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] assume !(~ret~1 % 4294967296 > 3); [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L5] ensures true; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] assume !(~ret~0 % 4294967296 > 3); [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L4] ensures true; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24-L26] assume 2 == ~result~0 % 4294967296; VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24] COND TRUE 2 == ~result~0 % 4294967296 VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24] COND TRUE 2 == ~result~0 % 4294967296 VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24] COND TRUE 2 == ~result~0 % 4294967296 VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret4 := main(); [L22] ~input~0 := #t~nondet2; [L22] havoc #t~nondet2; VAL [~input~0=4294967298] [L23] CALL call #t~ret3 := id(~input~0); VAL [#in~x=4294967298] [L7-L12] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L8] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L9] CALL call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967297] [L14-L19] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L15] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L16] CALL call #t~ret1 := id(~x - 1); VAL [#in~x=4294967296] [L7-L12] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L8] COND TRUE 0 == ~x % 4294967296 [L8] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L16] RET call #t~ret1 := id(~x - 1); VAL [#in~x=4294967297, #t~ret1=0, ~x=4294967297] [L16] ~ret~1 := 1 + #t~ret1; [L16] havoc #t~ret1; VAL [#in~x=4294967297, ~ret~1=1, ~x=4294967297] [L17] COND FALSE !(~ret~1 % 4294967296 > 3) [L18] #res := ~ret~1; VAL [#in~x=4294967297, #res=1, ~ret~1=1, ~x=4294967297] [L9] RET call #t~ret0 := id2(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L9] ~ret~0 := 1 + #t~ret0; [L9] havoc #t~ret0; VAL [#in~x=4294967298, ~ret~0=2, ~x=4294967298] [L10] COND FALSE !(~ret~0 % 4294967296 > 3) [L11] #res := ~ret~0; VAL [#in~x=4294967298, #res=2, ~ret~0=2, ~x=4294967298] [L23] RET call #t~ret3 := id(~input~0); VAL [#t~ret3=2, ~input~0=4294967298] [L23] ~result~0 := #t~ret3; [L23] havoc #t~ret3; VAL [~input~0=4294967298, ~result~0=2] [L24] COND TRUE 2 == ~result~0 % 4294967296 VAL [~input~0=4294967298, ~result~0=2] [L25] assert false; VAL [~input~0=4294967298, ~result~0=2] [L22] unsigned int input = __VERIFIER_nondet_uint(); [L23] CALL, EXPR id(input) VAL [\old(x)=2] [L8] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=1] [L15] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L16] CALL, EXPR id(x-1) VAL [\old(x)=0] [L8] COND TRUE x==0 [L8] return 0; VAL [\old(x)=0, \result=0, x=0] [L16] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L16] unsigned int ret = id(x-1) + 1; [L17] COND FALSE !(ret > 3) [L18] return ret; VAL [\old(x)=1, \result=1, ret=1, x=1] [L9] RET, EXPR id2(x-1) VAL [\old(x)=2, id2(x-1)=1, x=2] [L9] unsigned int ret = id2(x-1) + 1; [L10] COND FALSE !(ret > 3) [L11] return ret; VAL [\old(x)=2, \result=2, ret=2, x=2] [L23] RET, EXPR id(input) VAL [id(input)=2, input=2] [L23] unsigned int result = id(input); [L24] COND TRUE result == 2 VAL [input=2, result=2] [L25] __VERIFIER_error() VAL [input=2, result=2] ----- [2018-11-23 02:46:07,504 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1a9d3d47-4089-4781-9ef7-d71991c4adee/bin-2019/uautomizer/witness.graphml [2018-11-23 02:46:07,504 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 02:46:07,505 INFO L168 Benchmark]: Toolchain (without parser) took 1321.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 959.3 MB in the beginning and 1.0 GB in the end (delta: -79.3 MB). Peak memory consumption was 64.9 MB. Max. memory is 11.5 GB. [2018-11-23 02:46:07,506 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:46:07,506 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.23 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:46:07,507 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.38 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 02:46:07,507 INFO L168 Benchmark]: Boogie Preprocessor took 11.60 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:46:07,507 INFO L168 Benchmark]: RCFGBuilder took 201.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:46:07,509 INFO L168 Benchmark]: TraceAbstraction took 884.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. [2018-11-23 02:46:07,510 INFO L168 Benchmark]: Witness Printer took 37.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:46:07,511 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.23 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.38 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.60 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 201.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 22.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 884.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 85.5 MB). Peak memory consumption was 85.5 MB. Max. memory is 11.5 GB. * Witness Printer took 37.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 25]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] unsigned int input = __VERIFIER_nondet_uint(); [L23] CALL, EXPR id(input) VAL [\old(x)=2] [L8] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L9] CALL, EXPR id2(x-1) VAL [\old(x)=1] [L15] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L16] CALL, EXPR id(x-1) VAL [\old(x)=0] [L8] COND TRUE x==0 [L8] return 0; VAL [\old(x)=0, \result=0, x=0] [L16] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L16] unsigned int ret = id(x-1) + 1; [L17] COND FALSE !(ret > 3) [L18] return ret; VAL [\old(x)=1, \result=1, ret=1, x=1] [L9] RET, EXPR id2(x-1) VAL [\old(x)=2, id2(x-1)=1, x=2] [L9] unsigned int ret = id2(x-1) + 1; [L10] COND FALSE !(ret > 3) [L11] return ret; VAL [\old(x)=2, \result=2, ret=2, x=2] [L23] RET, EXPR id(input) VAL [id(input)=2, input=2] [L23] unsigned int result = id(input); [L24] COND TRUE result == 2 VAL [input=2, result=2] [L25] __VERIFIER_error() VAL [input=2, result=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. UNSAFE Result, 0.8s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 8 SDslu, 479 SDs, 0 SdLazy, 67 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 134 NumberOfCodeBlocks, 134 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 5478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...