./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3428809e66c8ffa9373e37ec3d02a46642c7f8bc ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:37:32,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:37:32,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:37:32,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:37:32,918 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:37:32,918 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:37:32,919 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:37:32,921 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:37:32,922 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:37:32,923 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:37:32,924 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:37:32,924 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:37:32,925 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:37:32,926 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:37:32,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:37:32,928 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:37:32,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:37:32,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:37:32,932 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:37:32,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:37:32,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:37:32,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:37:32,937 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:37:32,937 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:37:32,937 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:37:32,938 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:37:32,939 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:37:32,940 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:37:32,940 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:37:32,941 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:37:32,942 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:37:32,942 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:37:32,943 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:37:32,943 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:37:32,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:37:32,944 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:37:32,944 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-22 21:37:32,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:37:32,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:37:32,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:37:32,958 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:37:32,958 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 21:37:32,959 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 21:37:32,959 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 21:37:32,959 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 21:37:32,959 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 21:37:32,959 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 21:37:32,959 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 21:37:32,960 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 21:37:32,960 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 21:37:32,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:37:32,961 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 21:37:32,961 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:37:32,961 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:37:32,961 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:37:32,961 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:37:32,961 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:37:32,962 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-22 21:37:32,962 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:37:32,962 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:37:32,962 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:37:32,962 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:37:32,962 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:37:32,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:37:32,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:37:32,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:37:32,963 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:37:32,963 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:37:32,964 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:37:32,964 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 21:37:32,964 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:37:32,964 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:37:32,964 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 21:37:32,964 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_42ac862e-5d85-4463-a942-d29b2412c3b5/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3428809e66c8ffa9373e37ec3d02a46642c7f8bc [2018-11-22 21:37:32,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:37:33,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:37:33,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:37:33,006 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:37:33,007 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:37:33,007 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2018-11-22 21:37:33,051 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/data/a6ff5fe41/7a73885b619247988254ecbf18fddf2b/FLAG99e2f3f02 [2018-11-22 21:37:33,398 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:37:33,399 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2018-11-22 21:37:33,403 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/data/a6ff5fe41/7a73885b619247988254ecbf18fddf2b/FLAG99e2f3f02 [2018-11-22 21:37:33,415 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/data/a6ff5fe41/7a73885b619247988254ecbf18fddf2b [2018-11-22 21:37:33,418 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:37:33,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:37:33,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:37:33,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:37:33,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:37:33,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab0a94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33, skipping insertion in model container [2018-11-22 21:37:33,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:37:33,459 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:37:33,596 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:37:33,599 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:37:33,614 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:37:33,628 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:37:33,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33 WrapperNode [2018-11-22 21:37:33,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:37:33,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:37:33,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:37:33,629 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:37:33,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:37:33,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:37:33,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:37:33,653 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:37:33,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... [2018-11-22 21:37:33,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:37:33,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:37:33,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:37:33,733 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:37:33,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/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-22 21:37:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 21:37:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:37:33,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:37:33,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 21:37:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:37:33,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:37:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 21:37:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:37:33,776 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:37:33,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 21:37:33,926 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:37:33,926 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 21:37:33,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:37:33 BoogieIcfgContainer [2018-11-22 21:37:33,927 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:37:33,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:37:33,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:37:33,931 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:37:33,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:37:33" (1/3) ... [2018-11-22 21:37:33,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63772965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:37:33, skipping insertion in model container [2018-11-22 21:37:33,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:37:33" (2/3) ... [2018-11-22 21:37:33,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63772965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:37:33, skipping insertion in model container [2018-11-22 21:37:33,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:37:33" (3/3) ... [2018-11-22 21:37:33,934 INFO L112 eAbstractionObserver]: Analyzing ICFG HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2018-11-22 21:37:33,941 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:37:33,947 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-22 21:37:33,962 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-22 21:37:33,989 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:37:33,990 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:37:33,990 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:37:33,990 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:37:33,990 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:37:33,990 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:37:33,990 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:37:33,990 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:37:34,003 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-22 21:37:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-22 21:37:34,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:37:34,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:37:34,009 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 21:37:34,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:34,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1819880950, now seen corresponding path program 1 times [2018-11-22 21:37:34,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:37:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:34,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:37:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:34,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:37:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:37:34,176 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-22 21:37:34,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:37:34,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:37:34,179 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:37:34,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 21:37:34,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 21:37:34,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 21:37:34,197 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-22 21:37:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:37:34,264 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-11-22 21:37:34,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:37:34,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-22 21:37:34,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:37:34,272 INFO L225 Difference]: With dead ends: 65 [2018-11-22 21:37:34,273 INFO L226 Difference]: Without dead ends: 39 [2018-11-22 21:37:34,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:37:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-22 21:37:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-11-22 21:37:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 21:37:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-22 21:37:34,305 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 10 [2018-11-22 21:37:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:37:34,305 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-22 21:37:34,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 21:37:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-22 21:37:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-22 21:37:34,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:37:34,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:37:34,306 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 21:37:34,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:34,307 INFO L82 PathProgramCache]: Analyzing trace with hash 852311453, now seen corresponding path program 1 times [2018-11-22 21:37:34,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:37:34,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:34,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:37:34,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:34,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:37:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:37:34,350 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-22 21:37:34,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:37:34,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:37:34,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:37:34,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:37:34,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:37:34,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:37:34,352 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 3 states. [2018-11-22 21:37:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:37:34,378 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-22 21:37:34,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:37:34,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-22 21:37:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:37:34,379 INFO L225 Difference]: With dead ends: 39 [2018-11-22 21:37:34,380 INFO L226 Difference]: Without dead ends: 28 [2018-11-22 21:37:34,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:37:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-22 21:37:34,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-22 21:37:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 21:37:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-22 21:37:34,385 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 12 [2018-11-22 21:37:34,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:37:34,385 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-22 21:37:34,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:37:34,385 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-22 21:37:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-22 21:37:34,386 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:37:34,386 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:37:34,386 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 21:37:34,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash 264114482, now seen corresponding path program 1 times [2018-11-22 21:37:34,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:37:34,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:34,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:37:34,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:34,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:37:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:37:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:37:34,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:37:34,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:37:34,445 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-22 21:37:34,446 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [17], [19], [20], [21], [23], [55], [56], [57] [2018-11-22 21:37:34,474 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 21:37:34,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 21:37:34,631 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 21:37:34,633 INFO L272 AbstractInterpreter]: Visited 12 different actions 27 times. Merged at 5 different actions 13 times. Never widened. Performed 150 root evaluator evaluations with a maximum evaluation depth of 3. Performed 150 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-11-22 21:37:34,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:34,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 21:37:34,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:37:34,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/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-22 21:37:34,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:37:34,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 21:37:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:37:34,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:37:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:37:34,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:37:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:37:34,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 21:37:34,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-22 21:37:34,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 21:37:34,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 21:37:34,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 21:37:34,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:37:34,818 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2018-11-22 21:37:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:37:34,888 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-22 21:37:34,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 21:37:34,889 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-22 21:37:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:37:34,890 INFO L225 Difference]: With dead ends: 45 [2018-11-22 21:37:34,890 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 21:37:34,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2018-11-22 21:37:34,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 21:37:34,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-11-22 21:37:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-22 21:37:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-22 21:37:34,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 14 [2018-11-22 21:37:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:37:34,896 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-22 21:37:34,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 21:37:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-22 21:37:34,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-22 21:37:34,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:37:34,897 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:37:34,898 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 21:37:34,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:34,898 INFO L82 PathProgramCache]: Analyzing trace with hash -402385597, now seen corresponding path program 1 times [2018-11-22 21:37:34,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:37:34,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:34,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:37:34,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:34,900 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:37:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:37:34,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:37:34,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:37:34,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:37:34,953 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2018-11-22 21:37:34,953 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [17], [19], [21], [22], [23], [55], [56], [57] [2018-11-22 21:37:34,954 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 21:37:34,954 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 21:37:35,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 21:37:35,004 INFO L272 AbstractInterpreter]: Visited 12 different actions 27 times. Merged at 5 different actions 13 times. Never widened. Performed 150 root evaluator evaluations with a maximum evaluation depth of 3. Performed 150 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 17 variables. [2018-11-22 21:37:35,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:35,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 21:37:35,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:37:35,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:37:35,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:37:35,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 21:37:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:37:35,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:37:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:37:35,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:37:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:37:35,130 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-22 21:37:35,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [5] total 11 [2018-11-22 21:37:35,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:37:35,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 21:37:35,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 21:37:35,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-22 21:37:35,131 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 6 states. [2018-11-22 21:37:35,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:37:35,173 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-22 21:37:35,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 21:37:35,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-22 21:37:35,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:37:35,175 INFO L225 Difference]: With dead ends: 31 [2018-11-22 21:37:35,175 INFO L226 Difference]: Without dead ends: 30 [2018-11-22 21:37:35,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-22 21:37:35,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-22 21:37:35,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-22 21:37:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 21:37:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-22 21:37:35,180 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 15 [2018-11-22 21:37:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:37:35,180 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-22 21:37:35,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 21:37:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-22 21:37:35,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:37:35,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:37:35,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:37:35,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 21:37:35,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:35,181 INFO L82 PathProgramCache]: Analyzing trace with hash 409354713, now seen corresponding path program 1 times [2018-11-22 21:37:35,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:37:35,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:35,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:37:35,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:35,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:37:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:37:35,269 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-22 21:37:35,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:37:35,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:37:35,269 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-11-22 21:37:35,270 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [15], [17], [19], [21], [23], [27], [36], [41], [42], [55], [56], [57] [2018-11-22 21:37:35,271 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 21:37:35,271 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 21:37:35,341 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 21:37:35,342 INFO L272 AbstractInterpreter]: Visited 16 different actions 43 times. Merged at 8 different actions 24 times. Widened at 1 different actions 1 times. Performed 220 root evaluator evaluations with a maximum evaluation depth of 3. Performed 220 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-11-22 21:37:35,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:35,345 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 21:37:35,391 INFO L227 lantSequenceWeakener]: Weakened 14 states. On average, predicates are now at 74.49% of their original sizes. [2018-11-22 21:37:35,391 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 21:37:35,423 INFO L415 sIntCurrentIteration]: We unified 15 AI predicates to 15 [2018-11-22 21:37:35,423 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 21:37:35,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 21:37:35,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2018-11-22 21:37:35,425 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:37:35,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 21:37:35,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 21:37:35,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:37:35,426 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 5 states. [2018-11-22 21:37:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:37:35,561 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-22 21:37:35,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 21:37:35,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-22 21:37:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:37:35,563 INFO L225 Difference]: With dead ends: 40 [2018-11-22 21:37:35,563 INFO L226 Difference]: Without dead ends: 38 [2018-11-22 21:37:35,563 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 21:37:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-22 21:37:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-11-22 21:37:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-22 21:37:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-22 21:37:35,568 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 16 [2018-11-22 21:37:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:37:35,568 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-22 21:37:35,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 21:37:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-22 21:37:35,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:37:35,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:37:35,569 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:37:35,569 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 21:37:35,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:35,569 INFO L82 PathProgramCache]: Analyzing trace with hash -215550354, now seen corresponding path program 2 times [2018-11-22 21:37:35,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:37:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:35,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:37:35,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:35,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:37:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:37:35,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:37:35,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:37:35,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 21:37:35,623 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 21:37:35,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 21:37:35,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 21:37:35,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 21:37:35,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 21:37:35,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 21:37:35,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-22 21:37:35,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 21:37:35,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 21:37:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 21:37:35,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 21:37:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 21:37:35,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 21:37:35,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2018-11-22 21:37:35,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 21:37:35,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 21:37:35,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 21:37:35,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-22 21:37:35,702 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 11 states. [2018-11-22 21:37:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:37:35,836 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-11-22 21:37:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 21:37:35,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-22 21:37:35,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:37:35,838 INFO L225 Difference]: With dead ends: 85 [2018-11-22 21:37:35,839 INFO L226 Difference]: Without dead ends: 84 [2018-11-22 21:37:35,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-22 21:37:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-22 21:37:35,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 27. [2018-11-22 21:37:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 21:37:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-22 21:37:35,847 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-11-22 21:37:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:37:35,847 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-22 21:37:35,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 21:37:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-22 21:37:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:37:35,848 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:37:35,849 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:37:35,851 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 21:37:35,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:37:35,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1747109637, now seen corresponding path program 1 times [2018-11-22 21:37:35,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:37:35,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:35,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 21:37:35,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:37:35,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:37:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:37:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 21:37:35,895 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2147483650, |#NULL.offset|=2147483648, |old(#NULL.base)|=2147483650, |old(#NULL.offset)|=2147483648] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2147483650, |old(#NULL.offset)|=2147483648] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2147483650, |old(#NULL.offset)|=2147483648] [?] RET #56#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a_length~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~a_length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(~a_length~0 < 1);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~a_length~0);~j~0 := 0; VAL [main_~a_length~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !!(~j~0 < ~a_length~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet2; VAL [main_~a_length~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] #t~post1 := ~j~0; VAL [main_~a_length~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~post1|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume 1 + #t~post1 <= 2147483647; VAL [main_~a_length~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~post1|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume 1 + #t~post1 >= -2147483648;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~a_length~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !(~j~0 < ~a_length~0); VAL [main_~a_length~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] ~offset~0 := 1;~i~0 := 0; VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !!(~i~0 < ~a_length~0);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=2147483647, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !(#t~mem3 < 0);havoc #t~mem3; VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume ~i~0 + ~offset~0 <= 2147483647; VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume ~i~0 + ~offset~0 >= -2147483648;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=2147483647, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !(~i~0 + ~offset~0 + #t~mem4 <= 2147483647); VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=2147483647, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2147483650, #NULL.offset=2147483648, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~a_length~0=1] [L13-L15] assume !(~a_length~0 < 1); [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] assume !!(~j~0 < ~a_length~0); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L18] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL.base=0, #NULL.offset=0, #t~post1=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~post1=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] assume !(~j~0 < ~a_length~0); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] assume !!(~i~0 < ~a_length~0); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23-L25] assume !(#t~mem3 < 0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2147483650, #NULL.offset=2147483648, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~a_length~0=1] [L13-L15] assume !(~a_length~0 < 1); [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] assume !!(~j~0 < ~a_length~0); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L18] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL.base=0, #NULL.offset=0, #t~post1=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~post1=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] assume !(~j~0 < ~a_length~0); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] assume !!(~i~0 < ~a_length~0); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23-L25] assume !(#t~mem3 < 0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483650, #NULL!offset=2147483648, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~a_length~0=1] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483650, #NULL!offset=2147483648, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~a_length~0=1] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483650, #NULL!offset=2147483648, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~a_length~0=1] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483650, #NULL!offset=2147483648, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~a_length~0=1] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L12] int a_length = __VERIFIER_nondet_int(); [L13] COND FALSE !(a_length < 1) [L16] int a[a_length]; [L17] int j = 0; VAL [a={2147483649:0}, a_length=1, j=0] [L17] COND TRUE j < a_length [L18] a[j] = __VERIFIER_nondet_int() [L17] j++ VAL [a={2147483649:0}, a_length=1, j=1] [L17] COND FALSE !(j < a_length) VAL [a={2147483649:0}, a_length=1, j=1] [L20] int offset = 1; [L21] int i = 0; VAL [a={2147483649:0}, a_length=1, i=0, j=1, offset=1] [L22] COND TRUE i < a_length [L23] EXPR a[i] VAL [a={2147483649:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] [L23] COND FALSE !(a[i] < 0) [L26] EXPR i + offset [L26] EXPR a[i] VAL [a={2147483649:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] [L26] i + offset + a[i] VAL [a={2147483649:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] ----- [2018-11-22 21:37:35,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:37:35 BoogieIcfgContainer [2018-11-22 21:37:35,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:37:35,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:37:35,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:37:35,945 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:37:35,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:37:33" (3/4) ... [2018-11-22 21:37:35,948 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|=2147483650, |#NULL.offset|=2147483648, |old(#NULL.base)|=2147483650, |old(#NULL.offset)|=2147483648] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2147483650, |old(#NULL.offset)|=2147483648] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2147483650, |old(#NULL.offset)|=2147483648] [?] RET #56#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~a_length~0 := #t~nondet0;havoc #t~nondet0; VAL [main_~a_length~0=1, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !(~a_length~0 < 1);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~a_length~0);~j~0 := 0; VAL [main_~a_length~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !!(~j~0 < ~a_length~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet2; VAL [main_~a_length~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] #t~post1 := ~j~0; VAL [main_~a_length~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~post1|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume 1 + #t~post1 <= 2147483647; VAL [main_~a_length~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~post1|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume 1 + #t~post1 >= -2147483648;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~a_length~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !(~j~0 < ~a_length~0); VAL [main_~a_length~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] ~offset~0 := 1;~i~0 := 0; VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !!(~i~0 < ~a_length~0);call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem3|=2147483647, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !(#t~mem3 < 0);havoc #t~mem3; VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume ~i~0 + ~offset~0 <= 2147483647; VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume ~i~0 + ~offset~0 >= -2147483648;call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=2147483647, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] assume !(~i~0 + ~offset~0 + #t~mem4 <= 2147483647); VAL [main_~a_length~0=1, main_~i~0=0, main_~j~0=1, main_~offset~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem4|=2147483647, |main_~#a~0.base|=2147483649, |main_~#a~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2147483650, #NULL.offset=2147483648, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~a_length~0=1] [L13-L15] assume !(~a_length~0 < 1); [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] assume !!(~j~0 < ~a_length~0); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L18] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL.base=0, #NULL.offset=0, #t~post1=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~post1=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] assume !(~j~0 < ~a_length~0); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] assume !!(~i~0 < ~a_length~0); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23-L25] assume !(#t~mem3 < 0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2147483650, #NULL.offset=2147483648, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2147483650, old(#NULL.offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL.base=0, #NULL.offset=0, ~a_length~0=1] [L13-L15] assume !(~a_length~0 < 1); [L16] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] assume !!(~j~0 < ~a_length~0); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L18] havoc #t~nondet2; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL.base=0, #NULL.offset=0, #t~post1=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~post1=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] assume !(~j~0 < ~a_length~0); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] assume !!(~i~0 < ~a_length~0); [L23] call #t~mem3 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem3=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23-L25] assume !(#t~mem3 < 0); [L23] havoc #t~mem3; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~mem4=2147483647, ~#a~0.base=2147483649, ~#a~0.offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483650, #NULL!offset=2147483648, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~a_length~0=1] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483650, #NULL!offset=2147483648, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~a_length~0=1] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483650, #NULL!offset=2147483648, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~a_length~0=1] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2147483650, #NULL!offset=2147483648, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2147483650, old(#NULL!offset)=2147483648] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~a_length~0 := #t~nondet0; [L12] havoc #t~nondet0; VAL [#NULL!base=0, #NULL!offset=0, ~a_length~0=1] [L13] COND FALSE !(~a_length~0 < 1) [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~a_length~0); [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17-L19] COND FALSE !(!(~j~0 < ~a_length~0)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L18] havoc #t~nondet2; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] #t~post1 := ~j~0; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~post1=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=0] [L17] assert 1 + #t~post1 >= -2147483648; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L17-L19] COND TRUE !(~j~0 < ~a_length~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~j~0=1] [L20] ~offset~0 := 1; [L21] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L22-L27] COND FALSE !(!(~i~0 < ~a_length~0)) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem3=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L23] COND FALSE !(#t~mem3 < 0) [L23] havoc #t~mem3; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 >= -2147483648; [L26] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L26] assert ~i~0 + ~offset~0 + #t~mem4 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~mem4=2147483647, ~#a~0!base=2147483649, ~#a~0!offset=0, ~a_length~0=1, ~i~0=0, ~j~0=1, ~offset~0=1] [L12] int a_length = __VERIFIER_nondet_int(); [L13] COND FALSE !(a_length < 1) [L16] int a[a_length]; [L17] int j = 0; VAL [a={2147483649:0}, a_length=1, j=0] [L17] COND TRUE j < a_length [L18] a[j] = __VERIFIER_nondet_int() [L17] j++ VAL [a={2147483649:0}, a_length=1, j=1] [L17] COND FALSE !(j < a_length) VAL [a={2147483649:0}, a_length=1, j=1] [L20] int offset = 1; [L21] int i = 0; VAL [a={2147483649:0}, a_length=1, i=0, j=1, offset=1] [L22] COND TRUE i < a_length [L23] EXPR a[i] VAL [a={2147483649:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] [L23] COND FALSE !(a[i] < 0) [L26] EXPR i + offset [L26] EXPR a[i] VAL [a={2147483649:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] [L26] i + offset + a[i] VAL [a={2147483649:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] ----- [2018-11-22 21:37:36,001 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_42ac862e-5d85-4463-a942-d29b2412c3b5/bin-2019/utaipan/witness.graphml [2018-11-22 21:37:36,001 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:37:36,002 INFO L168 Benchmark]: Toolchain (without parser) took 2583.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 958.1 MB in the beginning and 908.0 MB in the end (delta: 50.1 MB). Peak memory consumption was 200.0 MB. Max. memory is 11.5 GB. [2018-11-22 21:37:36,004 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:37:36,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.10 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:37:36,005 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.36 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:37:36,005 INFO L168 Benchmark]: Boogie Preprocessor took 79.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -203.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:37:36,006 INFO L168 Benchmark]: RCFGBuilder took 194.23 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:37:36,007 INFO L168 Benchmark]: TraceAbstraction took 2017.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.5 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:37:36,007 INFO L168 Benchmark]: Witness Printer took 56.51 ms. Allocated memory is still 1.2 GB. Free memory was 911.5 MB in the beginning and 908.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:37:36,011 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 208.10 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 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 23.36 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -203.0 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 194.23 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: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2017.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.5 MB in the end (delta: 217.7 MB). Peak memory consumption was 217.7 MB. Max. memory is 11.5 GB. * Witness Printer took 56.51 ms. Allocated memory is still 1.2 GB. Free memory was 911.5 MB in the beginning and 908.0 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: 26]: integer overflow possible integer overflow possible We found a FailurePath: [L12] int a_length = __VERIFIER_nondet_int(); [L13] COND FALSE !(a_length < 1) [L16] int a[a_length]; [L17] int j = 0; VAL [a={2147483649:0}, a_length=1, j=0] [L17] COND TRUE j < a_length [L18] a[j] = __VERIFIER_nondet_int() [L17] j++ VAL [a={2147483649:0}, a_length=1, j=1] [L17] COND FALSE !(j < a_length) VAL [a={2147483649:0}, a_length=1, j=1] [L20] int offset = 1; [L21] int i = 0; VAL [a={2147483649:0}, a_length=1, i=0, j=1, offset=1] [L22] COND TRUE i < a_length [L23] EXPR a[i] VAL [a={2147483649:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] [L23] COND FALSE !(a[i] < 0) [L26] EXPR i + offset [L26] EXPR a[i] VAL [a={2147483649:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] [L26] i + offset + a[i] VAL [a={2147483649:0}, a[i]=2147483647, a_length=1, i=0, j=1, offset=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 6 error locations. UNSAFE Result, 1.9s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 120 SDtfs, 190 SDslu, 331 SDs, 0 SdLazy, 128 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 143 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.8878306878306877 AbsIntWeakeningRatio, 0.7333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 3.4 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 85 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 150 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 5591 SizeOfPredicates, 8 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 12 InterpolantComputations, 4 PerfectInterpolantSequences, 20/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...