./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_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3428809e66c8ffa9373e37ec3d02a46642c7f8bc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:43:50,735 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:43:50,736 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:43:50,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:43:50,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:43:50,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:43:50,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:43:50,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:43:50,749 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:43:50,750 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:43:50,750 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:43:50,750 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:43:50,751 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:43:50,752 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:43:50,753 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:43:50,753 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:43:50,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:43:50,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:43:50,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:43:50,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:43:50,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:43:50,759 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:43:50,761 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:43:50,761 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:43:50,762 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:43:50,762 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:43:50,763 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:43:50,764 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:43:50,764 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:43:50,765 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:43:50,765 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:43:50,766 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:43:50,766 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:43:50,766 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:43:50,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:43:50,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:43:50,767 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 12:43:50,777 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:43:50,778 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:43:50,778 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:43:50,778 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:43:50,779 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:43:50,779 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:43:50,779 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:43:50,779 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:43:50,780 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:43:50,780 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:43:50,780 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:43:50,780 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:43:50,780 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:43:50,780 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:43:50,780 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 12:43:50,781 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:43:50,781 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:43:50,781 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:43:50,781 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:43:50,781 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:43:50,781 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:43:50,782 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:43:50,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:43:50,782 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:43:50,782 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:43:50,782 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:43:50,782 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:43:50,782 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:43:50,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:43:50,783 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3428809e66c8ffa9373e37ec3d02a46642c7f8bc [2018-11-23 12:43:50,807 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:43:50,817 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:43:50,820 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:43:50,822 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:43:50,822 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:43:50,822 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2018-11-23 12:43:50,872 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/data/1df476188/b12b68c0d21a43f0979a77a27d1498ca/FLAG8be8b3930 [2018-11-23 12:43:51,196 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:43:51,196 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/sv-benchmarks/c/termination-crafted-lit/HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2018-11-23 12:43:51,200 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/data/1df476188/b12b68c0d21a43f0979a77a27d1498ca/FLAG8be8b3930 [2018-11-23 12:43:51,635 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/data/1df476188/b12b68c0d21a43f0979a77a27d1498ca [2018-11-23 12:43:51,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:43:51,638 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:43:51,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:43:51,638 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:43:51,641 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:43:51,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb2c58d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51, skipping insertion in model container [2018-11-23 12:43:51,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:43:51,660 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:43:51,768 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:43:51,771 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:43:51,782 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:43:51,793 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:43:51,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51 WrapperNode [2018-11-23 12:43:51,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:43:51,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:43:51,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:43:51,794 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:43:51,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,807 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:43:51,812 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:43:51,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:43:51,812 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:43:51,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... [2018-11-23 12:43:51,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:43:51,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:43:51,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:43:51,828 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:43:51,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:43:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:43:51,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:43:51,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:43:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:43:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:43:51,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:43:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:43:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:43:51,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:43:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:43:52,012 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:43:52,013 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:43:52,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:52 BoogieIcfgContainer [2018-11-23 12:43:52,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:43:52,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:43:52,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:43:52,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:43:52,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:43:51" (1/3) ... [2018-11-23 12:43:52,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f4f311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:43:52, skipping insertion in model container [2018-11-23 12:43:52,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:43:51" (2/3) ... [2018-11-23 12:43:52,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f4f311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:43:52, skipping insertion in model container [2018-11-23 12:43:52,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:52" (3/3) ... [2018-11-23 12:43:52,018 INFO L112 eAbstractionObserver]: Analyzing ICFG HeizmannHoenickeLeikePodelski-ATVA2013-Fig7_false-no-overflow.c [2018-11-23 12:43:52,024 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:43:52,029 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-23 12:43:52,038 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-23 12:43:52,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:43:52,062 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:43:52,063 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:43:52,063 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:43:52,063 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:43:52,063 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:43:52,063 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:43:52,063 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:43:52,063 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:43:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:43:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 12:43:52,081 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:52,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:52,083 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:43:52,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1819880950, now seen corresponding path program 1 times [2018-11-23 12:43:52,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:52,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:52,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:52,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:52,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:52,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:52,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:43:52,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:43:52,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:43:52,226 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 4 states. [2018-11-23 12:43:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:52,273 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2018-11-23 12:43:52,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:43:52,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-11-23 12:43:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:52,280 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:43:52,280 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:43:52,282 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-23 12:43:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:43:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-11-23 12:43:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:43:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-11-23 12:43:52,305 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 10 [2018-11-23 12:43:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:52,305 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-11-23 12:43:52,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:43:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-11-23 12:43:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 12:43:52,306 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:52,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:52,306 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:43:52,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:52,307 INFO L82 PathProgramCache]: Analyzing trace with hash 852311453, now seen corresponding path program 1 times [2018-11-23 12:43:52,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:52,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:52,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:52,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:52,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:52,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:43:52,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:52,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:52,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:52,342 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 3 states. [2018-11-23 12:43:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:52,368 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 12:43:52,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:52,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 12:43:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:52,369 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:43:52,369 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:43:52,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:43:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 12:43:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:43:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 12:43:52,373 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 12 [2018-11-23 12:43:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:52,373 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 12:43:52,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:43:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:43:52,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:52,374 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:52,374 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:43:52,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:52,375 INFO L82 PathProgramCache]: Analyzing trace with hash 264114482, now seen corresponding path program 1 times [2018-11-23 12:43:52,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:52,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:52,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:52,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:43:52,438 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:43:52,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:52,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:43:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:52,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:43:52,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-23 12:43:52,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:43:52,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:43:52,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:43:52,550 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2018-11-23 12:43:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:52,601 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 12:43:52,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:43:52,601 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 12:43:52,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:52,602 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:43:52,602 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:43:52,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:43:52,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:43:52,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-11-23 12:43:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:43:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-23 12:43:52,605 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 14 [2018-11-23 12:43:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:52,605 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-23 12:43:52,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:43:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:43:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:43:52,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:52,606 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:52,606 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:43:52,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:52,606 INFO L82 PathProgramCache]: Analyzing trace with hash -402385597, now seen corresponding path program 1 times [2018-11-23 12:43:52,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:52,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:52,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:52,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:52,658 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-23 12:43:52,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:43:52,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:43:52,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:52,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:43:52,703 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-23 12:43:52,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:43:52,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-11-23 12:43:52,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:43:52,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:43:52,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:43:52,718 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-11-23 12:43:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:52,764 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:43:52,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:43:52,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-11-23 12:43:52,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:52,765 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:43:52,765 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:43:52,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:43:52,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:43:52,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 12:43:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:43:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-23 12:43:52,768 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 15 [2018-11-23 12:43:52,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:52,768 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-23 12:43:52,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:43:52,768 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-23 12:43:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:43:52,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:52,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:52,769 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:43:52,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash 409354713, now seen corresponding path program 1 times [2018-11-23 12:43:52,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:52,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:52,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:52,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:43:52,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:43:52,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/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-23 12:43:52,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:52,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:43:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:43:52,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:43:52,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2018-11-23 12:43:52,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:43:52,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:43:52,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:43:52,861 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 9 states. [2018-11-23 12:43:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:53,004 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 12:43:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:43:53,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-11-23 12:43:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:53,004 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:43:53,004 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:43:53,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:43:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:43:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2018-11-23 12:43:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:43:53,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-23 12:43:53,008 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 16 [2018-11-23 12:43:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:53,009 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 12:43:53,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:43:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 12:43:53,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:43:53,009 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:53,010 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:53,010 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:43:53,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:53,010 INFO L82 PathProgramCache]: Analyzing trace with hash -194905710, now seen corresponding path program 1 times [2018-11-23 12:43:53,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:53,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:53,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:53,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:43:53,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:43:53,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:43:53,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:43:53,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:43:53,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:53,043 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 3 states. [2018-11-23 12:43:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:53,056 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:43:53,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:43:53,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 12:43:53,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:53,057 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:43:53,057 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:43:53,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:43:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:43:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2018-11-23 12:43:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:43:53,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-11-23 12:43:53,062 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 17 [2018-11-23 12:43:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:53,062 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-11-23 12:43:53,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:43:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-23 12:43:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:43:53,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:53,063 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:43:53,063 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:43:53,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash -215550354, now seen corresponding path program 2 times [2018-11-23 12:43:53,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:53,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:53,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:43:53,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:43:53,108 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-23 12:43:53,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:43:53,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:43:53,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:43:53,122 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:43:53,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:43:53,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:43:53,159 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-23 12:43:53,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:43:53,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 10 [2018-11-23 12:43:53,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:43:53,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:43:53,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:43:53,178 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 11 states. [2018-11-23 12:43:53,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:43:53,268 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-23 12:43:53,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:43:53,269 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 12:43:53,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:43:53,270 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:43:53,270 INFO L226 Difference]: Without dead ends: 83 [2018-11-23 12:43:53,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:43:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-23 12:43:53,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 42. [2018-11-23 12:43:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:43:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-11-23 12:43:53,277 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 18 [2018-11-23 12:43:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:43:53,277 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-11-23 12:43:53,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:43:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:43:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:43:53,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:43:53,278 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-23 12:43:53,282 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 12:43:53,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:43:53,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1747109637, now seen corresponding path program 1 times [2018-11-23 12:43:53,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:43:53,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:43:53,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:53,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:43:53,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:43:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:43:53,320 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-23 12:43:53,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:43:53 BoogieIcfgContainer [2018-11-23 12:43:53,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:43:53,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:43:53,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:43:53,360 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:43:53,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:43:52" (3/4) ... [2018-11-23 12:43:53,363 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-23 12:43:53,425 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8415f51a-82a0-4b38-8db1-f2478d4e7837/bin-2019/uautomizer/witness.graphml [2018-11-23 12:43:53,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:43:53,426 INFO L168 Benchmark]: Toolchain (without parser) took 1788.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 959.3 MB in the beginning and 933.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:53,428 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:43:53,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:53,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.24 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:53,429 INFO L168 Benchmark]: Boogie Preprocessor took 16.39 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:43:53,429 INFO L168 Benchmark]: RCFGBuilder took 184.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:53,430 INFO L168 Benchmark]: TraceAbstraction took 1345.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.3 MB in the end (delta: 177.4 MB). Peak memory consumption was 177.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:53,430 INFO L168 Benchmark]: Witness Printer took 65.55 ms. Allocated memory is still 1.2 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:43:53,433 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.56 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 948.5 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 17.24 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.39 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 184.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1345.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.3 MB in the end (delta: 177.4 MB). Peak memory consumption was 177.4 MB. Max. memory is 11.5 GB. * Witness Printer took 65.55 ms. Allocated memory is still 1.2 GB. Free memory was 939.3 MB in the beginning and 933.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 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.3s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 231 SDslu, 332 SDs, 0 SdLazy, 234 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 82 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 183 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 5034 SizeOfPredicates, 6 NumberOfNonLiveVariables, 226 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 12/37 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...