./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/signedintegeroverflow-regression/Division_false-no-overflow.c.i --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_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/signedintegeroverflow-regression/Division_false-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/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 5a306c4fb589f9b20486de004bee6462f04078de ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:32:31,726 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:32:31,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:32:31,733 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:32:31,733 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:32:31,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:32:31,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:32:31,736 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:32:31,737 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:32:31,738 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:32:31,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:32:31,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:32:31,739 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:32:31,740 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:32:31,741 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:32:31,741 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:32:31,742 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:32:31,743 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:32:31,744 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:32:31,745 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:32:31,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:32:31,747 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:32:31,749 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:32:31,749 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:32:31,749 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:32:31,750 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:32:31,750 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:32:31,751 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:32:31,751 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:32:31,752 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:32:31,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:32:31,753 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:32:31,753 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:32:31,753 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:32:31,754 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:32:31,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:32:31,754 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 06:32:31,764 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:32:31,765 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:32:31,765 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:32:31,765 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:32:31,766 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:32:31,766 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:32:31,766 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:32:31,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:32:31,767 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:32:31,767 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:32:31,767 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:32:31,767 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:32:31,767 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:32:31,767 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:32:31,767 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 06:32:31,768 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:32:31,768 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:32:31,768 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:32:31,768 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:32:31,768 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:32:31,768 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:32:31,769 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:32:31,769 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:32:31,769 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:32:31,769 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:32:31,769 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:32:31,769 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:32:31,769 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:32:31,770 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:32:31,770 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_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/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 -> 5a306c4fb589f9b20486de004bee6462f04078de [2018-11-23 06:32:31,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:32:31,806 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:32:31,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:32:31,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:32:31,810 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:32:31,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/../../sv-benchmarks/c/signedintegeroverflow-regression/Division_false-no-overflow.c.i [2018-11-23 06:32:31,850 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/data/ee89fe7e8/8246048fecf0418da6208ac8d20e63e1/FLAG897699fd8 [2018-11-23 06:32:32,188 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:32:32,189 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/sv-benchmarks/c/signedintegeroverflow-regression/Division_false-no-overflow.c.i [2018-11-23 06:32:32,195 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/data/ee89fe7e8/8246048fecf0418da6208ac8d20e63e1/FLAG897699fd8 [2018-11-23 06:32:32,205 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/data/ee89fe7e8/8246048fecf0418da6208ac8d20e63e1 [2018-11-23 06:32:32,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:32:32,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:32:32,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:32:32,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:32:32,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:32:32,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725d32ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32, skipping insertion in model container [2018-11-23 06:32:32,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:32:32,241 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:32:32,417 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:32:32,423 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:32:32,486 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:32:32,510 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:32:32,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32 WrapperNode [2018-11-23 06:32:32,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:32:32,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:32:32,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:32:32,511 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:32:32,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:32:32,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:32:32,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:32:32,532 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:32:32,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... [2018-11-23 06:32:32,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:32:32,546 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:32:32,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:32:32,547 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:32:32,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/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 06:32:32,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:32:32,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:32:32,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:32:32,592 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:32:32,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:32:32,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 06:32:32,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:32:32,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:32:32,740 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:32:32,740 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 06:32:32,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:32:32 BoogieIcfgContainer [2018-11-23 06:32:32,741 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:32:32,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:32:32,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:32:32,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:32:32,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:32:32" (1/3) ... [2018-11-23 06:32:32,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92291fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:32:32, skipping insertion in model container [2018-11-23 06:32:32,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:32:32" (2/3) ... [2018-11-23 06:32:32,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92291fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:32:32, skipping insertion in model container [2018-11-23 06:32:32,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:32:32" (3/3) ... [2018-11-23 06:32:32,746 INFO L112 eAbstractionObserver]: Analyzing ICFG Division_false-no-overflow.c.i [2018-11-23 06:32:32,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:32:32,759 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 06:32:32,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 06:32:32,790 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:32:32,792 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:32:32,792 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:32:32,792 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:32:32,792 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:32:32,792 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:32:32,792 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:32:32,792 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:32:32,792 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:32:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 06:32:32,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 06:32:32,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:32:32,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:32:32,809 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:32:32,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:32:32,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2123086959, now seen corresponding path program 1 times [2018-11-23 06:32:32,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:32:32,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:32:32,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:32,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:32:32,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:32:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:32:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:32:32,897 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=104, |#NULL.offset|=101, |#t~string29.base|=103, |#t~string29.offset|=102, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string29.base, #t~string29.offset, 1);call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] RET #16#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] CALL call #t~ret30 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] ~minInt~0 := -2147483648; VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] assume !((if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647); VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=101, #t~string29.base=103, #t~string29.offset=102, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string29.base, #t~string29.offset, 1); [L334] call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1); [L334] call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1); [L334] call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=101, #t~string29.base=103, #t~string29.offset=102, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string29.base, #t~string29.offset, 1); [L334] call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1); [L334] call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1); [L334] call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L332] int minInt = -2147483647 - 1; VAL [minInt=-2147483648] [L333] minInt / -1 VAL [minInt=-2147483648] ----- [2018-11-23 06:32:32,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:32:32 BoogieIcfgContainer [2018-11-23 06:32:32,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:32:32,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:32:32,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:32:32,919 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:32:32,920 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:32:32" (3/4) ... [2018-11-23 06:32:32,921 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|=104, |#NULL.offset|=101, |#t~string29.base|=103, |#t~string29.offset|=102, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4);call write~init~int(37, #t~string29.base, #t~string29.offset, 1);call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1);call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1);call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0, |old(#NULL.base)|=104, |old(#NULL.offset)|=101, |old(#t~string29.base)|=103, |old(#t~string29.offset)|=102] [?] RET #16#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] CALL call #t~ret30 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] ~minInt~0 := -2147483648; VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] assume !((if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647); VAL [main_~minInt~0=(- 2147483648), |#NULL.base|=0, |#NULL.offset|=0, |#t~string29.base|=105, |#t~string29.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=101, #t~string29.base=103, #t~string29.offset=102, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string29.base, #t~string29.offset, 1); [L334] call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1); [L334] call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1); [L334] call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=104, #NULL.offset=101, #t~string29.base=103, #t~string29.offset=102, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L334] call #t~string29.base, #t~string29.offset := #Ultimate.alloc(4); [L334] call write~init~int(37, #t~string29.base, #t~string29.offset, 1); [L334] call write~init~int(100, #t~string29.base, 1 + #t~string29.offset, 1); [L334] call write~init~int(10, #t~string29.base, 2 + #t~string29.offset, 1); [L334] call write~init~int(0, #t~string29.base, 3 + #t~string29.offset, 1); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, old(#NULL.base)=104, old(#NULL.offset)=101, old(#t~string29.base)=103, old(#t~string29.offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~string29.base=105, #t~string29.offset=0, ~minInt~0=-2147483648] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=104, #NULL!offset=101, #t~string29!base=103, #t~string29!offset=102, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L334] FCALL call #t~string29 := #Ultimate.alloc(4); [L334] FCALL call write~init~int(37, { base: #t~string29!base, offset: #t~string29!offset }, 1); [L334] FCALL call write~init~int(100, { base: #t~string29!base, offset: 1 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(10, { base: #t~string29!base, offset: 2 + #t~string29!offset }, 1); [L334] FCALL call write~init~int(0, { base: #t~string29!base, offset: 3 + #t~string29!offset }, 1); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, old(#NULL!base)=104, old(#NULL!offset)=101, old(#t~string29!base)=103, old(#t~string29!offset)=102] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [?] CALL call #t~ret30 := main(); VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0] [L332] ~minInt~0 := -2147483648; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L333] assert (if ~minInt~0 < 0 && 0 != ~minInt~0 % -1 then ~minInt~0 / -1 - 1 else ~minInt~0 / -1) <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~string29!base=105, #t~string29!offset=0, ~minInt~0=-2147483648] [L332] int minInt = -2147483647 - 1; VAL [minInt=-2147483648] [L333] minInt / -1 VAL [minInt=-2147483648] ----- [2018-11-23 06:32:32,951 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1676f0b9-b51c-4629-b22e-8c2c8fa3c6e5/bin-2019/uautomizer/witness.graphml [2018-11-23 06:32:32,951 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:32:32,951 INFO L168 Benchmark]: Toolchain (without parser) took 743.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 959.1 MB in the beginning and 1.1 GB in the end (delta: -156.2 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-11-23 06:32:32,952 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:32:32,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -193.6 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:32:32,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:32:32,953 INFO L168 Benchmark]: Boogie Preprocessor took 14.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:32:32,953 INFO L168 Benchmark]: RCFGBuilder took 194.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:32:32,954 INFO L168 Benchmark]: TraceAbstraction took 177.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:32:32,954 INFO L168 Benchmark]: Witness Printer took 32.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:32:32,957 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 301.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -193.6 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 194.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 177.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Witness Printer took 32.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 333]: integer overflow possible integer overflow possible We found a FailurePath: [L332] int minInt = -2147483647 - 1; VAL [minInt=-2147483648] [L333] minInt / -1 VAL [minInt=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 7 NumberOfCodeBlocks, 7 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...