./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/skippedu_false-unreach-call.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_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/skippedu_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69a8cdfb90da21c880e2ea8c68ae8d9efb957756 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:05:38,809 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:05:38,811 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:05:38,818 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:05:38,818 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:05:38,818 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:05:38,819 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:05:38,820 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:05:38,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:05:38,821 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:05:38,822 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:05:38,822 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:05:38,823 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:05:38,823 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:05:38,824 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:05:38,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:05:38,825 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:05:38,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:05:38,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:05:38,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:05:38,829 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:05:38,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:05:38,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:05:38,832 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:05:38,832 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:05:38,832 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:05:38,833 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:05:38,834 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:05:38,834 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:05:38,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:05:38,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:05:38,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:05:38,836 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:05:38,836 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:05:38,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:05:38,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:05:38,837 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 14:05:38,847 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:05:38,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:05:38,847 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:05:38,847 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:05:38,848 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:05:38,848 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:05:38,848 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:05:38,848 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 14:05:38,848 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:05:38,848 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:05:38,848 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 14:05:38,849 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 14:05:38,849 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:05:38,849 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:05:38,849 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:05:38,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:05:38,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:05:38,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:05:38,850 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:05:38,850 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:05:38,850 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:05:38,850 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:05:38,850 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:05:38,850 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:05:38,851 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:05:38,851 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:05:38,851 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:05:38,851 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:05:38,851 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:05:38,851 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:05:38,851 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:05:38,852 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:05:38,852 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:05:38,852 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 14:05:38,852 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:05:38,852 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:05:38,852 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 14:05:38,852 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 69a8cdfb90da21c880e2ea8c68ae8d9efb957756 [2018-11-23 14:05:38,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:05:38,884 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:05:38,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:05:38,888 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:05:38,888 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:05:38,888 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/../../sv-benchmarks/c/array-tiling/skippedu_false-unreach-call.i [2018-11-23 14:05:38,931 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/data/a1d712b58/6fd5261bc88542f6b0d79279a55011fe/FLAGd5d0794c2 [2018-11-23 14:05:39,324 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:05:39,324 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/sv-benchmarks/c/array-tiling/skippedu_false-unreach-call.i [2018-11-23 14:05:39,328 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/data/a1d712b58/6fd5261bc88542f6b0d79279a55011fe/FLAGd5d0794c2 [2018-11-23 14:05:39,338 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/data/a1d712b58/6fd5261bc88542f6b0d79279a55011fe [2018-11-23 14:05:39,340 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:05:39,341 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:05:39,341 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:05:39,341 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:05:39,343 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:05:39,344 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,346 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45abf0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39, skipping insertion in model container [2018-11-23 14:05:39,346 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:05:39,364 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:05:39,473 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:05:39,475 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:05:39,489 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:05:39,501 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:05:39,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39 WrapperNode [2018-11-23 14:05:39,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:05:39,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:05:39,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:05:39,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:05:39,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:05:39,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:05:39,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:05:39,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:05:39,555 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... [2018-11-23 14:05:39,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:05:39,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:05:39,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:05:39,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:05:39,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:05:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:05:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:05:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:05:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:05:39,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:05:39,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:05:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:05:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:05:39,602 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:05:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 14:05:39,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 14:05:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:05:39,746 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:05:39,746 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 14:05:39,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:39 BoogieIcfgContainer [2018-11-23 14:05:39,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:05:39,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:05:39,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:05:39,750 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:05:39,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:05:39" (1/3) ... [2018-11-23 14:05:39,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c924c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:05:39, skipping insertion in model container [2018-11-23 14:05:39,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:05:39" (2/3) ... [2018-11-23 14:05:39,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c924c78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:05:39, skipping insertion in model container [2018-11-23 14:05:39,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:39" (3/3) ... [2018-11-23 14:05:39,752 INFO L112 eAbstractionObserver]: Analyzing ICFG skippedu_false-unreach-call.i [2018-11-23 14:05:39,758 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:05:39,764 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 14:05:39,777 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 14:05:39,801 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:05:39,802 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:05:39,802 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:05:39,802 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:05:39,802 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:05:39,802 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:05:39,802 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:05:39,802 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:05:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 14:05:39,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 14:05:39,815 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:39,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:39,816 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:39,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1661916020, now seen corresponding path program 1 times [2018-11-23 14:05:39,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:39,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:39,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:39,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:39,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:40,017 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 14:05:40,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:05:40,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:05:40,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:05:40,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:05:40,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:05:40,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:05:40,032 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 4 states. [2018-11-23 14:05:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:40,109 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2018-11-23 14:05:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:05:40,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-23 14:05:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:40,117 INFO L225 Difference]: With dead ends: 57 [2018-11-23 14:05:40,117 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 14:05:40,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:05:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 14:05:40,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-11-23 14:05:40,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 14:05:40,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 14:05:40,143 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2018-11-23 14:05:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:40,143 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 14:05:40,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:05:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 14:05:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:05:40,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:40,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:40,144 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:40,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:40,145 INFO L82 PathProgramCache]: Analyzing trace with hash 505215540, now seen corresponding path program 1 times [2018-11-23 14:05:40,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:40,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:40,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:40,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:40,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:40,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:05:40,489 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 14:05:40,489 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-23 14:05:40,491 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [18], [20], [23], [27], [32], [34], [38], [46], [60], [63], [65], [71], [72], [73], [75] [2018-11-23 14:05:40,513 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 14:05:40,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 14:05:40,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 14:05:40,731 INFO L272 AbstractInterpreter]: Visited 20 different actions 41 times. Merged at 6 different actions 18 times. Widened at 1 different actions 1 times. Performed 186 root evaluator evaluations with a maximum evaluation depth of 12. Performed 186 inverse root evaluator evaluations with a maximum inverse evaluation depth of 12. Found 4 fixpoints after 2 different actions. Largest state had 20 variables. [2018-11-23 14:05:40,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:40,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 14:05:40,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:05:40,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:05:40,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:40,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 14:05:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:05:40,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:05:40,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 14:05:40,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 14:05:40,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:05:40,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:05:40,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:05:40,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 14:05:40,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 14:05:40,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-23 14:05:40,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:05:40,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:05:40,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:05:40,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-23 14:05:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:40,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:05:41,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-11-23 14:05:41,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 14:05:41,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 14:05:41,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:05:41,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 14:05:41,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:5 [2018-11-23 14:05:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:05:41,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 14:05:41,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 20 [2018-11-23 14:05:41,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 14:05:41,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 14:05:41,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 14:05:41,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-11-23 14:05:41,081 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 16 states. [2018-11-23 14:05:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:05:41,349 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-23 14:05:41,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 14:05:41,350 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-23 14:05:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:05:41,352 INFO L225 Difference]: With dead ends: 56 [2018-11-23 14:05:41,352 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 14:05:41,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2018-11-23 14:05:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 14:05:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-11-23 14:05:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 14:05:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 14:05:41,361 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 20 [2018-11-23 14:05:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:05:41,361 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 14:05:41,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 14:05:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 14:05:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 14:05:41,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:05:41,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:05:41,363 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:05:41,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:05:41,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1206280118, now seen corresponding path program 1 times [2018-11-23 14:05:41,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:05:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:41,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:05:41,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:05:41,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:05:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:05:41,408 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=0] [?] RET #72#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 1; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=1, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(#t~mem3 > ~i~0);havoc #t~mem3; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(#t~mem4 > ~i~0);havoc #t~mem4; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] ~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=1, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L23-L26] assume !(#t~mem3 > ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27-L30] assume !(#t~mem4 > ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(~i~0 < ~SIZE~0); [L35] call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L23-L26] assume !(#t~mem3 > ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27-L30] assume !(#t~mem4 > ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(~i~0 < ~SIZE~0); [L35] call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L8] int SIZE; VAL [\old(SIZE)=10, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [\old(SIZE)=0, a={11:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={11:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={11:0}, a[2*i-2]=1, i=1, SIZE=2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR a[2*i-1] VAL [\old(SIZE)=0, a={11:0}, a[2*i-1]=0, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={11:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR a[i] VAL [\old(SIZE)=0, a={11:0}, a[i]=1, i=0, SIZE=2] [L35] CALL __VERIFIER_assert( a[i] <= i ) VAL [\old(cond)=0, \old(SIZE)=0, SIZE=2] [L5] COND TRUE !(cond) VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] ----- [2018-11-23 14:05:41,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:05:41 BoogieIcfgContainer [2018-11-23 14:05:41,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:05:41,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:05:41,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:05:41,441 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:05:41,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:05:39" (3/4) ... [2018-11-23 14:05:41,443 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|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9, |old(~SIZE~0)|=10, ~SIZE~0=0] [?] RET #72#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=0] [?] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);~i~0 := 1; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=1, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(#t~mem3 > ~i~0);havoc #t~mem3; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(#t~mem4 > ~i~0);havoc #t~mem4; VAL [main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] ~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !!(~i~0 < ~SIZE~0);call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=1, |main_~#a~0.base|=11, |main_~#a~0.offset|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |#NULL.base|=0, |#NULL.offset|=0, |__VERIFIER_assert_#in~cond|=0, |old(~SIZE~0)|=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L23-L26] assume !(#t~mem3 > ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27-L30] assume !(#t~mem4 > ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(~i~0 < ~SIZE~0); [L35] call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc ~i~0; [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 2), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L23-L26] assume !(#t~mem3 > ~i~0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * (2 * ~i~0 - 1), 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L27-L30] assume !(#t~mem4 > ~i~0); [L27] havoc #t~mem4; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] assume !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(~i~0 < ~SIZE~0); [L35] call #t~mem6 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0.base=11, ~#a~0.offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assume 0 == ~cond; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL.base=0, #NULL.offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=10] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9, old(~SIZE~0)=10, ~SIZE~0=0] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=0] [?] CALL call #t~ret7 := main(); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=0] [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L27] COND FALSE !(#t~mem4 > ~i~0) [L27] havoc #t~mem4; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=1, ~SIZE~0=2] [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=2, ~SIZE~0=2] [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=1, old(~SIZE~0)=0, ~#a~0!base=11, ~#a~0!offset=0, ~i~0=0, ~SIZE~0=2] [L35] CALL call __VERIFIER_assert((if #t~mem6 <= ~i~0 then 1 else 0)); VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~SIZE~0=2] [L5] ~cond := #in~cond; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L5] assert false; VAL [#in~cond=0, #NULL!base=0, #NULL!offset=0, old(~SIZE~0)=0, ~cond=0, ~SIZE~0=2] [L8] int SIZE; VAL [\old(SIZE)=10, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [\old(SIZE)=0, a={11:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={11:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={11:0}, a[2*i-2]=1, i=1, SIZE=2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR a[2*i-1] VAL [\old(SIZE)=0, a={11:0}, a[2*i-1]=0, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={11:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR a[i] VAL [\old(SIZE)=0, a={11:0}, a[i]=1, i=0, SIZE=2] [L35] CALL __VERIFIER_assert( a[i] <= i ) VAL [\old(cond)=0, \old(SIZE)=0, SIZE=2] [L5] COND TRUE !(cond) VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] ----- [2018-11-23 14:05:41,496 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ccfea22a-da32-4853-95dd-be99dfa3bf2f/bin-2019/utaipan/witness.graphml [2018-11-23 14:05:41,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:05:41,497 INFO L168 Benchmark]: Toolchain (without parser) took 2156.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 958.2 MB in the beginning and 883.1 MB in the end (delta: 75.0 MB). Peak memory consumption was 201.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:41,498 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:05:41,498 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.27 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:41,498 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:41,499 INFO L168 Benchmark]: Boogie Preprocessor took 52.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:41,499 INFO L168 Benchmark]: RCFGBuilder took 178.38 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: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:41,500 INFO L168 Benchmark]: TraceAbstraction took 1692.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.6 MB in the end (delta: 218.8 MB). Peak memory consumption was 218.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:41,500 INFO L168 Benchmark]: Witness Printer took 55.68 ms. Allocated memory is still 1.2 GB. Free memory was 886.6 MB in the beginning and 883.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 14:05:41,503 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.27 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 178.38 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: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1692.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 886.6 MB in the end (delta: 218.8 MB). Peak memory consumption was 218.8 MB. Max. memory is 11.5 GB. * Witness Printer took 55.68 ms. Allocated memory is still 1.2 GB. Free memory was 886.6 MB in the beginning and 883.1 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 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: [L8] int SIZE; VAL [\old(SIZE)=10, SIZE=0] [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [\old(SIZE)=0, a={11:0}, SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [\old(SIZE)=0, a={11:0}, i=1, SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] VAL [\old(SIZE)=0, a={11:0}, a[2*i-2]=1, i=1, SIZE=2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR a[2*i-1] VAL [\old(SIZE)=0, a={11:0}, a[2*i-1]=0, i=1, SIZE=2] [L27] COND FALSE !(a[2*i-1] > i) [L21] i++ VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L21] COND FALSE !(i <= SIZE/2) VAL [\old(SIZE)=0, a={11:0}, i=2, SIZE=2] [L33] i = 0 VAL [\old(SIZE)=0, a={11:0}, i=0, SIZE=2] [L33] COND TRUE i < SIZE [L35] EXPR a[i] VAL [\old(SIZE)=0, a={11:0}, a[i]=1, i=0, SIZE=2] [L35] CALL __VERIFIER_assert( a[i] <= i ) VAL [\old(cond)=0, \old(SIZE)=0, SIZE=2] [L5] COND TRUE !(cond) VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] [L5] __VERIFIER_error() VAL [\old(cond)=0, \old(SIZE)=0, cond=0, SIZE=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. UNSAFE Result, 1.6s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 43 SDtfs, 138 SDslu, 120 SDs, 0 SdLazy, 227 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 20 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 75 NumberOfCodeBlocks, 75 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 8253 SizeOfPredicates, 10 NumberOfNonLiveVariables, 79 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...