./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/array_false-unreach-call_true-termination.i --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_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/array_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/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 c9c01a6cc6331754f7a6c99ec20becb53bf53c79 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:14:48,142 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:14:48,144 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:14:48,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:14:48,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:14:48,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:14:48,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:14:48,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:14:48,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:14:48,158 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:14:48,159 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:14:48,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:14:48,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:14:48,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:14:48,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:14:48,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:14:48,164 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:14:48,165 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:14:48,167 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:14:48,169 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:14:48,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:14:48,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:14:48,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:14:48,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:14:48,173 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:14:48,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:14:48,174 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:14:48,176 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:14:48,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:14:48,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:14:48,177 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:14:48,178 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:14:48,178 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:14:48,178 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:14:48,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:14:48,180 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:14:48,181 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:14:48,192 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:14:48,192 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:14:48,193 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:14:48,193 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:14:48,194 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:14:48,194 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:14:48,194 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:14:48,194 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:14:48,194 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:14:48,195 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:14:48,195 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:14:48,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:14:48,195 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:14:48,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:14:48,195 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:14:48,195 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:14:48,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:14:48,196 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:14:48,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:14:48,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:14:48,196 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:14:48,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:14:48,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:14:48,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:14:48,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:14:48,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:14:48,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:14:48,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:14:48,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:14:48,198 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:14:48,198 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_f3d681d9-5bae-4e94-9b63-d96e0670f440/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 -> c9c01a6cc6331754f7a6c99ec20becb53bf53c79 [2018-11-23 03:14:48,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:14:48,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:14:48,240 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:14:48,241 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:14:48,241 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:14:48,242 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/../../sv-benchmarks/c/loops/array_false-unreach-call_true-termination.i [2018-11-23 03:14:48,285 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/data/e30954496/e55664fe2a1840459257d3bb7ea3ad97/FLAGd7a015c08 [2018-11-23 03:14:48,647 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:14:48,648 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/sv-benchmarks/c/loops/array_false-unreach-call_true-termination.i [2018-11-23 03:14:48,652 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/data/e30954496/e55664fe2a1840459257d3bb7ea3ad97/FLAGd7a015c08 [2018-11-23 03:14:49,059 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/data/e30954496/e55664fe2a1840459257d3bb7ea3ad97 [2018-11-23 03:14:49,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:14:49,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:14:49,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:14:49,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:14:49,067 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:14:49,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49, skipping insertion in model container [2018-11-23 03:14:49,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:14:49,091 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:14:49,215 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:14:49,218 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:14:49,232 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:14:49,248 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:14:49,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49 WrapperNode [2018-11-23 03:14:49,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:14:49,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:14:49,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:14:49,249 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:14:49,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,262 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:14:49,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:14:49,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:14:49,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:14:49,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... [2018-11-23 03:14:49,327 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:14:49,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:14:49,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:14:49,327 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:14:49,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:14:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:14:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:14:49,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:14:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:14:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:14:49,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:14:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:14:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:14:49,367 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:14:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 03:14:49,367 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 03:14:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:14:49,502 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:14:49,502 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 03:14:49,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:14:49 BoogieIcfgContainer [2018-11-23 03:14:49,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:14:49,503 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:14:49,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:14:49,506 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:14:49,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:14:49" (1/3) ... [2018-11-23 03:14:49,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c631623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:14:49, skipping insertion in model container [2018-11-23 03:14:49,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:49" (2/3) ... [2018-11-23 03:14:49,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c631623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:14:49, skipping insertion in model container [2018-11-23 03:14:49,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:14:49" (3/3) ... [2018-11-23 03:14:49,509 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call_true-termination.i [2018-11-23 03:14:49,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:14:49,521 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:14:49,532 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:14:49,553 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:14:49,553 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:14:49,553 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:14:49,553 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:14:49,554 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:14:49,554 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:14:49,554 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:14:49,554 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:14:49,554 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:14:49,566 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-23 03:14:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 03:14:49,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:14:49,571 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:14:49,572 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:14:49,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:49,577 INFO L82 PathProgramCache]: Analyzing trace with hash 202253298, now seen corresponding path program 1 times [2018-11-23 03:14:49,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:49,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:49,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:49,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:49,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:14:49,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:14:49,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:14:49,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:14:49,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:14:49,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:14:49,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:14:49,699 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-23 03:14:49,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:14:49,714 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 03:14:49,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:14:49,715 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-23 03:14:49,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:14:49,721 INFO L225 Difference]: With dead ends: 35 [2018-11-23 03:14:49,721 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 03:14:49,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:14:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 03:14:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 03:14:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 03:14:49,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 03:14:49,752 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-11-23 03:14:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:14:49,752 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 03:14:49,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:14:49,752 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 03:14:49,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 03:14:49,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:14:49,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:14:49,753 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:14:49,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:49,753 INFO L82 PathProgramCache]: Analyzing trace with hash -112667363, now seen corresponding path program 1 times [2018-11-23 03:14:49,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:49,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:49,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:49,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:49,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:14:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:14:49,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:14:49,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:14:49,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:14:49,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:14:49,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:14:49,847 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 03:14:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:14:49,868 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 03:14:49,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:14:49,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 03:14:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:14:49,869 INFO L225 Difference]: With dead ends: 24 [2018-11-23 03:14:49,869 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 03:14:49,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:14:49,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 03:14:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-11-23 03:14:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 03:14:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 03:14:49,873 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2018-11-23 03:14:49,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:14:49,874 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 03:14:49,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:14:49,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 03:14:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 03:14:49,874 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:14:49,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:14:49,875 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:14:49,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:49,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1912057964, now seen corresponding path program 1 times [2018-11-23 03:14:49,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:49,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:49,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:49,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:49,938 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #40#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume #t~mem3 <= ~menor~0;havoc #t~mem3;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem4;havoc #t~mem4; VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem5|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L20] havoc #t~nondet2; [L22] call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22-L23] assume #t~mem3 <= ~menor~0; [L22] havoc #t~mem3; [L23] call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem5=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L20] havoc #t~nondet2; [L22] call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22-L23] assume #t~mem3 <= ~menor~0; [L22] havoc #t~mem3; [L23] call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem5=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] unsigned int SIZE=1; [L14] unsigned int j,k; [L15] int array[SIZE], menor; [L17] menor = __VERIFIER_nondet_int() [L19] j=0 VAL [array={6:0}, j=0, menor=0, SIZE=1] [L19] COND TRUE jmenor) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 03:14:49,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:14:49 BoogieIcfgContainer [2018-11-23 03:14:49,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:14:49,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:14:49,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:14:49,976 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:14:49,976 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:14:49" (3/4) ... [2018-11-23 03:14:49,978 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=7, |#NULL.offset|=5, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=7, |old(#NULL.offset)|=5] [?] RET #40#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~SIZE~0 := 1;havoc ~j~0;havoc ~k~0;call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296));havoc ~menor~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~menor~0 := #t~nondet0;havoc #t~nondet0;~j~0 := 0; VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);havoc #t~nondet2;call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume #t~mem3 <= ~menor~0;havoc #t~mem3;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);~menor~0 := #t~mem4;havoc #t~mem4; VAL [main_~j~0=0, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [main_~j~0=1, main_~menor~0=0, main_~SIZE~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem5|=0, |main_~#array~0.base|=6, |main_~#array~0.offset|=0] [?] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L20] havoc #t~nondet2; [L22] call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22-L23] assume #t~mem3 <= ~menor~0; [L22] havoc #t~mem3; [L23] call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem5=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=7, #NULL.offset=5, old(#NULL.base)=7, old(#NULL.offset)=5] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=7, old(#NULL.offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] call write~int(#t~nondet2, ~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L20] havoc #t~nondet2; [L22] call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22-L23] assume #t~mem3 <= ~menor~0; [L22] havoc #t~mem3; [L23] call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] call #t~mem5 := read~int(~#array~0.base, ~#array~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem5=0, ~#array~0.base=6, ~#array~0.offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=7, #NULL!offset=5, old(#NULL!base)=7, old(#NULL!offset)=5] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=7, old(#NULL!offset)=5] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret6 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L13] ~SIZE~0 := 1; [L14] havoc ~j~0; [L14] havoc ~k~0; [L15] FCALL call ~#array~0 := #Ultimate.alloc(4 * (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296)); [L15] havoc ~menor~0; [L17] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L17] ~menor~0 := #t~nondet0; [L17] havoc #t~nondet0; [L19] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND FALSE !(!(~j~0 % 4294967296 < ~SIZE~0 % 4294967296)) [L20] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L20] FCALL call write~int(#t~nondet2, { base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L20] havoc #t~nondet2; [L22] FCALL call #t~mem3 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L22] COND TRUE #t~mem3 <= ~menor~0 [L22] havoc #t~mem3; [L23] FCALL call #t~mem4 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L23] ~menor~0 := #t~mem4; [L23] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=0, ~menor~0=0, ~SIZE~0=1] [L19] #t~post1 := ~j~0; [L19] ~j~0 := 1 + #t~post1; [L19] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L19-L24] COND TRUE !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] FCALL call #t~mem5 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem5=0, ~#array~0!base=6, ~#array~0!offset=0, ~j~0=1, ~menor~0=0, ~SIZE~0=1] [L26] CALL call __VERIFIER_assert((if #t~mem5 > ~menor~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, ~cond=0] [L13] unsigned int SIZE=1; [L14] unsigned int j,k; [L15] int array[SIZE], menor; [L17] menor = __VERIFIER_nondet_int() [L19] j=0 VAL [array={6:0}, j=0, menor=0, SIZE=1] [L19] COND TRUE jmenor) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 03:14:50,020 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f3d681d9-5bae-4e94-9b63-d96e0670f440/bin-2019/uautomizer/witness.graphml [2018-11-23 03:14:50,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:14:50,022 INFO L168 Benchmark]: Toolchain (without parser) took 959.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:50,023 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:14:50,024 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:50,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.07 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.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 03:14:50,025 INFO L168 Benchmark]: Boogie Preprocessor took 59.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -233.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:50,025 INFO L168 Benchmark]: RCFGBuilder took 175.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:50,026 INFO L168 Benchmark]: TraceAbstraction took 472.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:50,027 INFO L168 Benchmark]: Witness Printer took 45.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:50,030 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.95 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 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 19.07 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -233.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 175.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 472.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 11.5 GB. * Witness Printer took 45.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L13] unsigned int SIZE=1; [L14] unsigned int j,k; [L15] int array[SIZE], menor; [L17] menor = __VERIFIER_nondet_int() [L19] j=0 VAL [array={6:0}, j=0, menor=0, SIZE=1] [L19] COND TRUE jmenor) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 36 SDtfs, 3 SDslu, 11 SDs, 0 SdLazy, 7 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, 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, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...