./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3428809e66c8ffa9373e37ec3d02a46642c7f8bc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:26:48,742 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:26:48,744 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:26:48,752 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:26:48,752 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:26:48,753 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:26:48,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:26:48,754 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:26:48,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:26:48,756 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:26:48,756 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:26:48,757 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:26:48,757 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:26:48,758 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:26:48,759 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:26:48,759 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:26:48,760 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:26:48,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:26:48,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:26:48,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:26:48,763 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:26:48,764 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:26:48,765 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:26:48,766 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:26:48,766 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:26:48,766 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:26:48,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:26:48,767 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:26:48,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:26:48,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:26:48,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:26:48,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:26:48,769 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:26:48,769 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:26:48,770 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:26:48,770 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:26:48,770 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf [2018-11-23 12:26:48,779 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:26:48,779 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:26:48,780 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:26:48,780 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 12:26:48,781 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:26:48,781 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:26:48,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:26:48,781 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:26:48,781 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:26:48,781 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:26:48,781 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:26:48,781 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:26:48,782 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:26:48,782 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 12:26:48,782 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:26:48,782 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:26:48,782 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:26:48,782 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 12:26:48,782 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 12:26:48,782 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:26:48,783 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:26:48,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 12:26:48,783 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:26:48,783 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:26:48,783 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:26:48,783 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 12:26:48,783 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:26:48,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:26:48,783 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_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak 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 ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3428809e66c8ffa9373e37ec3d02a46642c7f8bc [2018-11-23 12:26:48,805 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:26:48,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:26:48,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:26:48,817 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:26:48,818 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:26:48,818 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/../../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2018-11-23 12:26:48,863 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/data/7a32a36f0/65ddc97226e24871a5ff50bf8ea0c1f9/FLAG348765e93 [2018-11-23 12:26:49,221 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:26:49,222 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2018-11-23 12:26:49,227 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/data/7a32a36f0/65ddc97226e24871a5ff50bf8ea0c1f9/FLAG348765e93 [2018-11-23 12:26:49,647 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/data/7a32a36f0/65ddc97226e24871a5ff50bf8ea0c1f9 [2018-11-23 12:26:49,649 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:26:49,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:26:49,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:26:49,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:26:49,654 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:26:49,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb2c58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49, skipping insertion in model container [2018-11-23 12:26:49,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:26:49,674 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:26:49,785 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:26:49,788 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:26:49,803 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:26:49,814 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:26:49,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49 WrapperNode [2018-11-23 12:26:49,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:26:49,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:26:49,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:26:49,815 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:26:49,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,829 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:26:49,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:26:49,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:26:49,845 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:26:49,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,854 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... [2018-11-23 12:26:49,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:26:49,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:26:49,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:26:49,911 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:26:49,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:26:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 12:26:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:26:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:26:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:26:49,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:26:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:26:49,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:26:50,089 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:26:50,090 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:26:50,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:50 BoogieIcfgContainer [2018-11-23 12:26:50,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:26:50,090 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 12:26:50,090 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 12:26:50,097 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 12:26:50,097 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:50" (1/1) ... [2018-11-23 12:26:50,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:26:50,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:26:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 20 states and 23 transitions. [2018-11-23 12:26:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 12:26:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 12:26:50,127 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:26:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:50,230 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 12:26:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:26:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 22 states and 27 transitions. [2018-11-23 12:26:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2018-11-23 12:26:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 12:26:50,286 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:26:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:50,303 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 12:26:50,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:26:50,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 23 states and 28 transitions. [2018-11-23 12:26:50,329 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2018-11-23 12:26:50,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 12:26:50,330 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:26:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:50,358 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 12:26:50,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:26:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 24 states and 29 transitions. [2018-11-23 12:26:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2018-11-23 12:26:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 12:26:50,443 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:26:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:50,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:26:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:26:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 26 states and 33 transitions. [2018-11-23 12:26:50,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-11-23 12:26:50,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 12:26:50,572 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:26:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:50,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:26:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:26:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 24 states and 28 transitions. [2018-11-23 12:26:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:26:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 12:26:50,775 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:26:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:50,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:26:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:26:51,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 27 states and 36 transitions. [2018-11-23 12:26:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2018-11-23 12:26:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:26:51,067 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:26:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:26:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:26:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 30 states and 40 transitions. [2018-11-23 12:26:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2018-11-23 12:26:51,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:26:51,231 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:26:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:26:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:26:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 12:26:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 34 states and 48 transitions. [2018-11-23 12:26:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2018-11-23 12:26:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 12:26:51,459 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 12:26:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:26:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:26:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:26:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:26:51,513 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 9 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0.base, main_~#a~0.offset, main_~offset~0, main_~i~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~a_length~0 := main_#t~nondet0;havoc main_#t~nondet0; VAL [ULTIMATE.start_main_~a_length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(main_~a_length~0 < 1);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * main_~a_length~0);main_~j~0 := 0; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !!(main_~j~0 < main_~a_length~0);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet2;main_#t~post1 := main_~j~0; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~post1|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume 1 + main_#t~post1 <= 2147483647; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~post1|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume 1 + main_#t~post1 >= -2147483648;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~j~0 < main_~a_length~0);}EndParallelCompositionmain_~offset~0 := 1;main_~i~0 := 0; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !!(main_~i~0 < main_~a_length~0);call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~mem3|=2147483647, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !(main_#t~mem3 < 0);havoc main_#t~mem3; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume main_~i~0 + main_~offset~0 <= 2147483647; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume main_~i~0 + main_~offset~0 >= -2147483648;call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~mem4|=2147483647, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !(main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647); VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~mem4|=2147483647, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0.base, main_~#a~0.offset, main_~offset~0, main_~i~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~a_length~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, main_~a_length~0=1] [L13-L15] assume !(main_~a_length~0 < 1); [L16] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * main_~a_length~0); [L17] main_~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17-L19] assume !!(main_~j~0 < main_~a_length~0); [L18] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L18] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4); [L18] havoc main_#t~nondet2; [L17] main_#t~post1 := main_~j~0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~post1=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~post1=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 >= -2147483648; [L17] main_~j~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=1] [L17-L19] assume !(main_~j~0 < main_~a_length~0); [L20] main_~offset~0 := 1; [L21] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L22-L27] assume !!(main_~i~0 < main_~a_length~0); [L23] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem3=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L23-L25] assume !(main_#t~mem3 < 0); [L23] havoc main_#t~mem3; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 >= -2147483648; [L26] call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem4=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem4=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0.base, main_~#a~0.offset, main_~offset~0, main_~i~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~a_length~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, main_~a_length~0=1] [L13-L15] assume !(main_~a_length~0 < 1); [L16] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * main_~a_length~0); [L17] main_~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17-L19] assume !!(main_~j~0 < main_~a_length~0); [L18] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L18] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4); [L18] havoc main_#t~nondet2; [L17] main_#t~post1 := main_~j~0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~post1=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~post1=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 >= -2147483648; [L17] main_~j~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=1] [L17-L19] assume !(main_~j~0 < main_~a_length~0); [L20] main_~offset~0 := 1; [L21] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L22-L27] assume !!(main_~i~0 < main_~a_length~0); [L23] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem3=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L23-L25] assume !(main_#t~mem3 < 0); [L23] havoc main_#t~mem3; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 >= -2147483648; [L26] call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem4=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem4=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0, main_~offset~0, main_~i~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~a_length~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, main_~a_length~0=1] [L13] COND FALSE !(main_~a_length~0 < 1) [L16] FCALL call main_~#a~0 := #Ultimate.alloc(4 * main_~a_length~0); [L17] main_~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17-L19] COND FALSE !(!(main_~j~0 < main_~a_length~0)) [L18] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L18] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~j~0 }, 4); [L18] havoc main_#t~nondet2; [L17] main_#t~post1 := main_~j~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~post1=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~post1=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 >= -2147483648; [L17] main_~j~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=1] [L17-L19] COND TRUE !(main_~j~0 < main_~a_length~0) [L20] main_~offset~0 := 1; [L21] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L22-L27] COND FALSE !(!(main_~i~0 < main_~a_length~0)) [L23] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem3=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L23] COND FALSE !(main_#t~mem3 < 0) [L23] havoc main_#t~mem3; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 >= -2147483648; [L26] FCALL call main_#t~mem4 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem4=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem4=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0, main_~offset~0, main_~i~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~a_length~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, main_~a_length~0=1] [L13] COND FALSE !(main_~a_length~0 < 1) [L16] FCALL call main_~#a~0 := #Ultimate.alloc(4 * main_~a_length~0); [L17] main_~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17-L19] COND FALSE !(!(main_~j~0 < main_~a_length~0)) [L18] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L18] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~j~0 }, 4); [L18] havoc main_#t~nondet2; [L17] main_#t~post1 := main_~j~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~post1=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~post1=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 >= -2147483648; [L17] main_~j~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=1] [L17-L19] COND TRUE !(main_~j~0 < main_~a_length~0) [L20] main_~offset~0 := 1; [L21] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L22-L27] COND FALSE !(!(main_~i~0 < main_~a_length~0)) [L23] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem3=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L23] COND FALSE !(main_#t~mem3 < 0) [L23] havoc main_#t~mem3; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 >= -2147483648; [L26] FCALL call main_#t~mem4 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem4=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem4=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L12] int a_length = __VERIFIER_nondet_int(); [L13] COND FALSE !(a_length < 1) [L16] int a[a_length]; [L17] int j = 0; [L17] COND TRUE j < a_length [L18] a[j] = __VERIFIER_nondet_int() [L17] j++ [L17] COND FALSE !(j < a_length) [L20] int offset = 1; [L21] int i = 0; [L22] COND TRUE i < a_length [L23] EXPR a[i] [L23] COND FALSE !(a[i] < 0) [L26] EXPR i + offset [L26] EXPR a[i] [L26] i + offset + a[i] ----- [2018-11-23 12:26:51,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 12:26:51 ImpRootNode [2018-11-23 12:26:51,545 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 12:26:51,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:26:51,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:26:51,546 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:26:51,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:26:50" (3/4) ... [2018-11-23 12:26:51,548 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0.base, main_~#a~0.offset, main_~offset~0, main_~i~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~a_length~0 := main_#t~nondet0;havoc main_#t~nondet0; VAL [ULTIMATE.start_main_~a_length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(main_~a_length~0 < 1);call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * main_~a_length~0);main_~j~0 := 0; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !!(main_~j~0 < main_~a_length~0);assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet2;main_#t~post1 := main_~j~0; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~post1|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume 1 + main_#t~post1 <= 2147483647; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~post1|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume 1 + main_#t~post1 >= -2147483648;main_~j~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~j~0 < main_~a_length~0);}EndParallelCompositionmain_~offset~0 := 1;main_~i~0 := 0; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !!(main_~i~0 < main_~a_length~0);call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~mem3|=2147483647, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !(main_#t~mem3 < 0);havoc main_#t~mem3; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume main_~i~0 + main_~offset~0 <= 2147483647; VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume main_~i~0 + main_~offset~0 >= -2147483648;call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~mem4|=2147483647, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] assume !(main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647); VAL [ULTIMATE.start_main_~a_length~0=1, ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_#t~mem4|=2147483647, |ULTIMATE.start_main_~#a~0.base|=3, |ULTIMATE.start_main_~#a~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0.base, main_~#a~0.offset, main_~offset~0, main_~i~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~a_length~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, main_~a_length~0=1] [L13-L15] assume !(main_~a_length~0 < 1); [L16] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * main_~a_length~0); [L17] main_~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17-L19] assume !!(main_~j~0 < main_~a_length~0); [L18] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L18] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4); [L18] havoc main_#t~nondet2; [L17] main_#t~post1 := main_~j~0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~post1=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~post1=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 >= -2147483648; [L17] main_~j~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=1] [L17-L19] assume !(main_~j~0 < main_~a_length~0); [L20] main_~offset~0 := 1; [L21] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L22-L27] assume !!(main_~i~0 < main_~a_length~0); [L23] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem3=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L23-L25] assume !(main_#t~mem3 < 0); [L23] havoc main_#t~mem3; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 >= -2147483648; [L26] call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem4=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem4=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0.base, main_~#a~0.offset, main_~offset~0, main_~i~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~a_length~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, main_~a_length~0=1] [L13-L15] assume !(main_~a_length~0 < 1); [L16] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * main_~a_length~0); [L17] main_~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17-L19] assume !!(main_~j~0 < main_~a_length~0); [L18] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L18] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~j~0, 4); [L18] havoc main_#t~nondet2; [L17] main_#t~post1 := main_~j~0; VAL [#NULL.base=0, #NULL.offset=0, main_#t~post1=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~post1=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 >= -2147483648; [L17] main_~j~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~j~0=1] [L17-L19] assume !(main_~j~0 < main_~a_length~0); [L20] main_~offset~0 := 1; [L21] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L22-L27] assume !!(main_~i~0 < main_~a_length~0); [L23] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem3=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L23-L25] assume !(main_#t~mem3 < 0); [L23] havoc main_#t~mem3; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 >= -2147483648; [L26] call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem4=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, main_#t~mem4=2147483647, main_~#a~0.base=3, main_~#a~0.offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0, main_~offset~0, main_~i~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~a_length~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, main_~a_length~0=1] [L13] COND FALSE !(main_~a_length~0 < 1) [L16] FCALL call main_~#a~0 := #Ultimate.alloc(4 * main_~a_length~0); [L17] main_~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17-L19] COND FALSE !(!(main_~j~0 < main_~a_length~0)) [L18] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L18] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~j~0 }, 4); [L18] havoc main_#t~nondet2; [L17] main_#t~post1 := main_~j~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~post1=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~post1=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 >= -2147483648; [L17] main_~j~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=1] [L17-L19] COND TRUE !(main_~j~0 < main_~a_length~0) [L20] main_~offset~0 := 1; [L21] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L22-L27] COND FALSE !(!(main_~i~0 < main_~a_length~0)) [L23] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem3=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L23] COND FALSE !(main_#t~mem3 < 0) [L23] havoc main_#t~mem3; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 >= -2147483648; [L26] FCALL call main_#t~mem4 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem4=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem4=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~post1, main_~j~0, main_#t~mem3, main_#t~mem4, main_~a_length~0, main_~#a~0, main_~offset~0, main_~i~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~a_length~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, main_~a_length~0=1] [L13] COND FALSE !(main_~a_length~0 < 1) [L16] FCALL call main_~#a~0 := #Ultimate.alloc(4 * main_~a_length~0); [L17] main_~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17-L19] COND FALSE !(!(main_~j~0 < main_~a_length~0)) [L18] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L18] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~j~0 }, 4); [L18] havoc main_#t~nondet2; [L17] main_#t~post1 := main_~j~0; VAL [#NULL!base=0, #NULL!offset=0, main_#t~post1=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~post1=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=0] [L17] assert 1 + main_#t~post1 >= -2147483648; [L17] main_~j~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~j~0=1] [L17-L19] COND TRUE !(main_~j~0 < main_~a_length~0) [L20] main_~offset~0 := 1; [L21] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L22-L27] COND FALSE !(!(main_~i~0 < main_~a_length~0)) [L23] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem3=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L23] COND FALSE !(main_#t~mem3 < 0) [L23] havoc main_#t~mem3; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 >= -2147483648; [L26] FCALL call main_#t~mem4 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem4=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [L26] assert main_~i~0 + main_~offset~0 + main_#t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, main_#t~mem4=2147483647, main_~#a~0!base=3, main_~#a~0!offset=0, main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0] [L12] int a_length = __VERIFIER_nondet_int(); [L13] COND FALSE !(a_length < 1) [L16] int a[a_length]; [L17] int j = 0; [L17] COND TRUE j < a_length [L18] a[j] = __VERIFIER_nondet_int() [L17] j++ [L17] COND FALSE !(j < a_length) [L20] int offset = 1; [L21] int i = 0; [L22] COND TRUE i < a_length [L23] EXPR a[i] [L23] COND FALSE !(a[i] < 0) [L26] EXPR i + offset [L26] EXPR a[i] [L26] i + offset + a[i] ----- [2018-11-23 12:26:51,593 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_aa8a04a1-5bad-4e8a-aeb9-84f1bffe5f10/bin-2019/ukojak/witness.graphml [2018-11-23 12:26:51,593 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:26:51,594 INFO L168 Benchmark]: Toolchain (without parser) took 1944.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 953.8 MB in the beginning and 830.2 MB in the end (delta: 123.6 MB). Peak memory consumption was 236.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:51,598 INFO L168 Benchmark]: CDTParser took 0.15 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 12:26:51,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.57 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:51,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.28 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.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 12:26:51,600 INFO L168 Benchmark]: Boogie Preprocessor took 66.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:51,601 INFO L168 Benchmark]: RCFGBuilder took 179.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:51,602 INFO L168 Benchmark]: CodeCheck took 1454.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 833.6 MB in the end (delta: 254.1 MB). Peak memory consumption was 254.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:51,602 INFO L168 Benchmark]: Witness Printer took 48.08 ms. Allocated memory is still 1.1 GB. Free memory was 833.6 MB in the beginning and 830.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:26:51,607 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 24 locations, 6 error locations. UNSAFE Result, 1.4s OverallTime, 9 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 868 SDtfs, 390 SDslu, 24 SDs, 0 SdLazy, 3726 SolverSat, 1348 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 478 GetRequests, 411 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 1155 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2/14 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 26]: integer overflow possible integer overflow possible We found a FailurePath: [L12] int a_length = __VERIFIER_nondet_int(); [L13] COND FALSE !(a_length < 1) [L16] int a[a_length]; [L17] int j = 0; [L17] COND TRUE j < a_length [L18] a[j] = __VERIFIER_nondet_int() [L17] j++ [L17] COND FALSE !(j < a_length) [L20] int offset = 1; [L21] int i = 0; [L22] COND TRUE i < a_length [L23] EXPR a[i] [L23] COND FALSE !(a[i] < 0) [L26] EXPR i + offset [L26] EXPR a[i] [L26] i + offset + a[i] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 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 163.57 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 29.28 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.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 66.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -168.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 179.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * CodeCheck took 1454.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 833.6 MB in the end (delta: 254.1 MB). Peak memory consumption was 254.1 MB. Max. memory is 11.5 GB. * Witness Printer took 48.08 ms. Allocated memory is still 1.1 GB. Free memory was 833.6 MB in the beginning and 830.2 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...