./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o3_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_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o3_false-unreach-call_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9b6c190b845f4496788acb9553cb85e1e7dace14 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:45:37,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:45:37,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:45:37,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:45:37,045 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:45:37,046 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:45:37,047 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:45:37,048 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:45:37,049 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:45:37,049 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:45:37,050 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:45:37,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:45:37,051 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:45:37,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:45:37,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:45:37,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:45:37,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:45:37,055 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:45:37,056 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:45:37,057 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:45:37,058 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:45:37,059 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:45:37,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:45:37,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:45:37,061 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:45:37,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:45:37,062 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:45:37,063 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:45:37,063 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:45:37,064 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:45:37,064 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:45:37,065 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:45:37,065 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:45:37,065 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:45:37,066 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:45:37,066 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:45:37,067 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 05:45:37,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:45:37,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:45:37,076 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:45:37,076 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 05:45:37,077 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 05:45:37,077 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 05:45:37,077 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 05:45:37,077 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 05:45:37,077 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 05:45:37,077 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 05:45:37,077 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 05:45:37,078 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 05:45:37,078 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 05:45:37,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:45:37,079 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:45:37,079 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:45:37,079 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:45:37,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:45:37,079 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:45:37,079 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:45:37,079 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:45:37,080 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:45:37,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:45:37,080 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:45:37,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:45:37,080 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:45:37,080 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 05:45:37,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:45:37,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 05:45:37,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 05:45:37,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:45:37,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:45:37,081 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:45:37,081 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 05:45:37,082 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:45:37,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:45:37,082 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 05:45:37,082 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan 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 -> Taipan 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 -> 9b6c190b845f4496788acb9553cb85e1e7dace14 [2018-11-23 05:45:37,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:45:37,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:45:37,118 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:45:37,120 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:45:37,120 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:45:37,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/../../sv-benchmarks/c/recursive-simple/id_o3_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 05:45:37,167 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/data/da85e1677/5f3c792969514210b060a0fdb1045eed/FLAG525967eef [2018-11-23 05:45:37,569 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:45:37,569 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/sv-benchmarks/c/recursive-simple/id_o3_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 05:45:37,573 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/data/da85e1677/5f3c792969514210b060a0fdb1045eed/FLAG525967eef [2018-11-23 05:45:37,582 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/data/da85e1677/5f3c792969514210b060a0fdb1045eed [2018-11-23 05:45:37,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:45:37,584 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:45:37,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:45:37,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:45:37,587 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:45:37,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f370fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37, skipping insertion in model container [2018-11-23 05:45:37,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:45:37,607 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:45:37,711 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:45:37,713 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:45:37,722 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:45:37,730 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:45:37,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37 WrapperNode [2018-11-23 05:45:37,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:45:37,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:45:37,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:45:37,731 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:45:37,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:45:37,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:45:37,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:45:37,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:45:37,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... [2018-11-23 05:45:37,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:45:37,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:45:37,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:45:37,755 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:45:37,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/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 05:45:37,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 05:45:37,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 05:45:37,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:45:37,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:45:37,833 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 05:45:37,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 05:45:37,833 INFO L130 BoogieDeclarations]: Found specification of procedure id [2018-11-23 05:45:37,833 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2018-11-23 05:45:37,923 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:45:37,923 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 05:45:37,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:45:37 BoogieIcfgContainer [2018-11-23 05:45:37,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:45:37,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 05:45:37,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 05:45:37,927 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 05:45:37,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 05:45:37" (1/3) ... [2018-11-23 05:45:37,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43de1f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:45:37, skipping insertion in model container [2018-11-23 05:45:37,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:45:37" (2/3) ... [2018-11-23 05:45:37,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43de1f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 05:45:37, skipping insertion in model container [2018-11-23 05:45:37,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:45:37" (3/3) ... [2018-11-23 05:45:37,929 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o3_false-unreach-call_true-termination_true-no-overflow.c [2018-11-23 05:45:37,936 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 05:45:37,941 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 05:45:37,951 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 05:45:37,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 05:45:37,973 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 05:45:37,973 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 05:45:37,973 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 05:45:37,973 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 05:45:37,973 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 05:45:37,973 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 05:45:37,974 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 05:45:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 05:45:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 05:45:37,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:37,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 05:45:37,994 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:45:37,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:37,999 INFO L82 PathProgramCache]: Analyzing trace with hash -872342019, now seen corresponding path program 1 times [2018-11-23 05:45:38,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:38,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:38,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:38,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:38,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:38,209 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 05:45:38,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 05:45:38,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 05:45:38,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 05:45:38,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 05:45:38,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 05:45:38,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 05:45:38,224 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2018-11-23 05:45:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:38,255 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 05:45:38,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 05:45:38,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 05:45:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:38,262 INFO L225 Difference]: With dead ends: 32 [2018-11-23 05:45:38,262 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 05:45:38,264 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 05:45:38,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 05:45:38,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 05:45:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 05:45:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 05:45:38,287 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 05:45:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:38,288 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 05:45:38,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 05:45:38,288 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 05:45:38,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 05:45:38,289 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:38,289 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 05:45:38,290 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:45:38,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:38,290 INFO L82 PathProgramCache]: Analyzing trace with hash -953570577, now seen corresponding path program 1 times [2018-11-23 05:45:38,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:38,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:38,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:38,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:38,395 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 05:45:38,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:45:38,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:45:38,396 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 20 with the following transitions: [2018-11-23 05:45:38,398 INFO L202 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [17], [20], [21], [23], [24], [25], [26], [27], [29], [30], [31], [32] [2018-11-23 05:45:38,421 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 05:45:38,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 05:45:38,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 05:45:38,534 INFO L272 AbstractInterpreter]: Visited 17 different actions 57 times. Merged at 5 different actions 21 times. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 3. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 4 variables. [2018-11-23 05:45:38,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:38,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 05:45:38,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:45:38,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/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 05:45:38,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:38,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 05:45:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:38,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:38,596 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 05:45:38,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:45:38,708 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 05:45:38,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:45:38,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 05:45:38,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:45:38,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 05:45:38,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 05:45:38,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:45:38,728 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 8 states. [2018-11-23 05:45:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:38,763 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 05:45:38,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 05:45:38,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 05:45:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:38,764 INFO L225 Difference]: With dead ends: 25 [2018-11-23 05:45:38,764 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 05:45:38,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-23 05:45:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 05:45:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 05:45:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 05:45:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 05:45:38,769 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-11-23 05:45:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:38,769 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 05:45:38,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 05:45:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 05:45:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 05:45:38,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:38,771 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 05:45:38,771 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:45:38,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:38,771 INFO L82 PathProgramCache]: Analyzing trace with hash 397359997, now seen corresponding path program 2 times [2018-11-23 05:45:38,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:38,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:38,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 05:45:38,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:38,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:45:38,882 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 05:45:38,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:45:38,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 05:45:38,883 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 05:45:38,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 05:45:38,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 05:45:38,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/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 05:45:38,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 05:45:38,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 05:45:38,919 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 05:45:38,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 05:45:38,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 05:45:38,950 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 05:45:38,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 05:45:39,113 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 05:45:39,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 05:45:39,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-23 05:45:39,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 05:45:39,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 05:45:39,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 05:45:39,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:45:39,130 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-11-23 05:45:39,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 05:45:39,161 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 05:45:39,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 05:45:39,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-11-23 05:45:39,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 05:45:39,163 INFO L225 Difference]: With dead ends: 28 [2018-11-23 05:45:39,163 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 05:45:39,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 05:45:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 05:45:39,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 05:45:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 05:45:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 05:45:39,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2018-11-23 05:45:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 05:45:39,167 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 05:45:39,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 05:45:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 05:45:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 05:45:39,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 05:45:39,168 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 05:45:39,168 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 05:45:39,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:45:39,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1198310127, now seen corresponding path program 3 times [2018-11-23 05:45:39,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 05:45:39,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:39,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 05:45:39,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 05:45:39,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 05:45:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:45:39,209 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~ret3 := main(); [?] ~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=4294967299] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=4294967299] [?] ~x := #in~x; VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] CALL call #t~ret0 := id(~x - 1); 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 := id(~x - 1); VAL [|id_#in~x|=4294967297] [?] ~x := #in~x; VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] CALL call #t~ret0 := 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 #32#return; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] assume true; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] RET #32#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #32#return; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] assume true; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] RET #30#return; VAL [main_~input~0=4294967299, |main_#t~ret2|=3] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967299, main_~result~0=3] [?] assume 3 == ~result~0 % 4294967296; VAL [main_~input~0=4294967299, main_~result~0=3] [?] assume !false; VAL [main_~input~0=4294967299, main_~result~0=3] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12-L14] assume 3 == ~result~0 % 4294967296; VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12-L14] assume 3 == ~result~0 % 4294967296; VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12] COND TRUE 3 == ~result~0 % 4294967296 VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12] COND TRUE 3 == ~result~0 % 4294967296 VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12] COND TRUE 3 == ~result~0 % 4294967296 VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12] COND TRUE 3 == ~result~0 % 4294967296 VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) 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; [L11] RET, EXPR id(input) VAL [id(input)=3, input=3] [L11] unsigned int result = id(input); [L12] COND TRUE result == 3 VAL [input=3, result=3] [L13] __VERIFIER_error() VAL [input=3, result=3] ----- [2018-11-23 05:45:39,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 05:45:39 BoogieIcfgContainer [2018-11-23 05:45:39,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 05:45:39,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:45:39,240 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:45:39,240 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:45:39,241 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:45:37" (3/4) ... [2018-11-23 05:45:39,243 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~ret3 := main(); [?] ~input~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~input~0=4294967299] [?] CALL call #t~ret2 := id(~input~0); VAL [|id_#in~x|=4294967299] [?] ~x := #in~x; VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967299, |id_#in~x|=4294967299] [?] CALL call #t~ret0 := id(~x - 1); 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 := id(~x - 1); VAL [|id_#in~x|=4294967297] [?] ~x := #in~x; VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] assume !(0 == ~x % 4294967296); VAL [id_~x=4294967297, |id_#in~x|=4294967297] [?] CALL call #t~ret0 := 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 #32#return; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#t~ret0|=0] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] assume true; VAL [id_~x=4294967297, |id_#in~x|=4294967297, |id_#res|=1] [?] RET #32#return; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#t~ret0|=1] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] assume true; VAL [id_~x=4294967298, |id_#in~x|=4294967298, |id_#res|=2] [?] RET #32#return; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#t~ret0|=2] [?] #res := 1 + #t~ret0;havoc #t~ret0; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] assume true; VAL [id_~x=4294967299, |id_#in~x|=4294967299, |id_#res|=3] [?] RET #30#return; VAL [main_~input~0=4294967299, |main_#t~ret2|=3] [?] ~result~0 := #t~ret2;havoc #t~ret2; VAL [main_~input~0=4294967299, main_~result~0=3] [?] assume 3 == ~result~0 % 4294967296; VAL [main_~input~0=4294967299, main_~result~0=3] [?] assume !false; VAL [main_~input~0=4294967299, main_~result~0=3] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12-L14] assume 3 == ~result~0 % 4294967296; VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] assume !(0 == ~x % 4294967296); VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] assume 0 == ~x % 4294967296; [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L4-L7] ensures true; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L4-L7] ensures true; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L4-L7] ensures true; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L4-L7] ensures true; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12-L14] assume 3 == ~result~0 % 4294967296; VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12] COND TRUE 3 == ~result~0 % 4294967296 VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12] COND TRUE 3 == ~result~0 % 4294967296 VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12] COND TRUE 3 == ~result~0 % 4294967296 VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L10] ~input~0 := #t~nondet1; [L10] havoc #t~nondet1; VAL [~input~0=4294967299] [L11] CALL call #t~ret2 := id(~input~0); VAL [#in~x=4294967299] [L4-L7] ~x := #in~x; VAL [#in~x=4294967299, ~x=4294967299] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967299, ~x=4294967299] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298] [L4-L7] ~x := #in~x; VAL [#in~x=4294967298, ~x=4294967298] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967298, ~x=4294967298] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297] [L4-L7] ~x := #in~x; VAL [#in~x=4294967297, ~x=4294967297] [L5] COND FALSE !(0 == ~x % 4294967296) VAL [#in~x=4294967297, ~x=4294967297] [L6] CALL call #t~ret0 := id(~x - 1); VAL [#in~x=4294967296] [L4-L7] ~x := #in~x; VAL [#in~x=4294967296, ~x=4294967296] [L5] COND TRUE 0 == ~x % 4294967296 [L5] #res := 0; VAL [#in~x=4294967296, #res=0, ~x=4294967296] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967297, #t~ret0=0, ~x=4294967297] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967297, #res=1, ~x=4294967297] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967298, #t~ret0=1, ~x=4294967298] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967298, #res=2, ~x=4294967298] [L6] RET call #t~ret0 := id(~x - 1); VAL [#in~x=4294967299, #t~ret0=2, ~x=4294967299] [L6] #res := 1 + #t~ret0; [L6] havoc #t~ret0; VAL [#in~x=4294967299, #res=3, ~x=4294967299] [L11] RET call #t~ret2 := id(~input~0); VAL [#t~ret2=3, ~input~0=4294967299] [L11] ~result~0 := #t~ret2; [L11] havoc #t~ret2; VAL [~input~0=4294967299, ~result~0=3] [L12] COND TRUE 3 == ~result~0 % 4294967296 VAL [~input~0=4294967299, ~result~0=3] [L13] assert false; VAL [~input~0=4294967299, ~result~0=3] [L10] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) 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; [L11] RET, EXPR id(input) VAL [id(input)=3, input=3] [L11] unsigned int result = id(input); [L12] COND TRUE result == 3 VAL [input=3, result=3] [L13] __VERIFIER_error() VAL [input=3, result=3] ----- [2018-11-23 05:45:39,274 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b9d1f745-8621-4ded-a009-ac4710b506ae/bin-2019/utaipan/witness.graphml [2018-11-23 05:45:39,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:45:39,275 INFO L168 Benchmark]: Toolchain (without parser) took 1690.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 958.2 MB in the beginning and 942.3 MB in the end (delta: 15.8 MB). Peak memory consumption was 126.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:39,276 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:45:39,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:39,277 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.39 ms. Allocated memory is still 1.0 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:45:39,277 INFO L168 Benchmark]: Boogie Preprocessor took 11.29 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:39,277 INFO L168 Benchmark]: RCFGBuilder took 168.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:39,278 INFO L168 Benchmark]: TraceAbstraction took 1315.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 945.0 MB in the end (delta: 154.1 MB). Peak memory consumption was 154.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:39,278 INFO L168 Benchmark]: Witness Printer took 33.91 ms. Allocated memory is still 1.1 GB. Free memory was 945.0 MB in the beginning and 942.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:45:39,282 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.01 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 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.39 ms. Allocated memory is still 1.0 GB. Free memory is still 947.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.29 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 168.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1315.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 945.0 MB in the end (delta: 154.1 MB). Peak memory consumption was 154.1 MB. Max. memory is 11.5 GB. * Witness Printer took 33.91 ms. Allocated memory is still 1.1 GB. Free memory was 945.0 MB in the beginning and 942.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 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] unsigned int input = __VERIFIER_nondet_uint(); [L11] CALL, EXPR id(input) 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; [L11] RET, EXPR id(input) VAL [id(input)=3, input=3] [L11] unsigned int result = id(input); [L12] COND TRUE result == 3 VAL [input=3, result=3] [L13] __VERIFIER_error() VAL [input=3, result=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. UNSAFE Result, 1.2s OverallTime, 4 OverallIterations, 4 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 2 SDslu, 270 SDs, 0 SdLazy, 58 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 9966 SizeOfPredicates, 2 NumberOfNonLiveVariables, 96 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 27/54 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...