./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.10_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_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.10_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/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 b61f9d11a7993733a89da24850eba50014a42dab ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:10:05,247 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:10:05,248 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:10:05,255 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:10:05,255 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:10:05,256 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:10:05,256 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:10:05,258 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:10:05,259 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:10:05,259 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:10:05,260 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:10:05,260 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:10:05,261 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:10:05,261 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:10:05,262 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:10:05,262 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:10:05,262 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:10:05,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:10:05,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:10:05,265 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:10:05,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:10:05,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:10:05,267 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:10:05,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:10:05,268 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:10:05,268 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:10:05,269 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:10:05,270 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:10:05,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:10:05,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:10:05,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:10:05,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:10:05,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:10:05,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:10:05,273 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:10:05,273 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:10:05,273 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 13:10:05,281 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:10:05,281 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:10:05,281 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:10:05,282 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:10:05,282 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:10:05,282 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:10:05,282 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:10:05,282 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:10:05,283 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:10:05,283 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:10:05,283 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:10:05,283 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:10:05,283 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:10:05,283 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:10:05,283 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 13:10:05,283 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:10:05,284 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:10:05,284 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:10:05,284 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:10:05,284 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:10:05,284 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:10:05,284 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:10:05,284 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:10:05,284 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:10:05,285 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:10:05,285 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:10:05,285 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:10:05,285 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:10:05,285 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:10:05,285 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_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/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 -> b61f9d11a7993733a89da24850eba50014a42dab [2018-11-23 13:10:05,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:10:05,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:10:05,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:10:05,319 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:10:05,320 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:10:05,320 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.10_false-no-overflow.c [2018-11-23 13:10:05,356 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/data/47760e27d/92af65c202d6492292fe844858aeda65/FLAGd9795e235 [2018-11-23 13:10:05,781 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:10:05,782 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/sv-benchmarks/c/termination-crafted-lit/ChenFlurMukhopadhyay-SAS2012-Ex2.10_false-no-overflow.c [2018-11-23 13:10:05,787 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/data/47760e27d/92af65c202d6492292fe844858aeda65/FLAGd9795e235 [2018-11-23 13:10:05,798 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/data/47760e27d/92af65c202d6492292fe844858aeda65 [2018-11-23 13:10:05,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:10:05,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:10:05,803 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:05,803 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:10:05,806 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:10:05,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@707ef55b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05, skipping insertion in model container [2018-11-23 13:10:05,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:10:05,830 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:10:05,951 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:05,953 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:10:05,961 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:10:05,970 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:10:05,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05 WrapperNode [2018-11-23 13:10:05,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:10:05,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:05,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:10:05,971 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:10:05,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:10:05,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:10:05,983 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:10:05,983 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:10:05,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,994 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... [2018-11-23 13:10:05,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:10:05,995 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:10:05,995 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:10:05,995 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:10:05,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/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 13:10:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:10:06,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:10:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:10:06,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:10:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:10:06,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:10:06,161 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:10:06,161 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:10:06,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:06 BoogieIcfgContainer [2018-11-23 13:10:06,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:10:06,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:10:06,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:10:06,165 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:10:06,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:10:05" (1/3) ... [2018-11-23 13:10:06,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716412e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:06, skipping insertion in model container [2018-11-23 13:10:06,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:10:05" (2/3) ... [2018-11-23 13:10:06,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716412e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:10:06, skipping insertion in model container [2018-11-23 13:10:06,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:06" (3/3) ... [2018-11-23 13:10:06,168 INFO L112 eAbstractionObserver]: Analyzing ICFG ChenFlurMukhopadhyay-SAS2012-Ex2.10_false-no-overflow.c [2018-11-23 13:10:06,173 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:10:06,177 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 13:10:06,189 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 13:10:06,213 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:10:06,214 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:10:06,214 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:10:06,214 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:10:06,214 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:10:06,214 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:10:06,214 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:10:06,215 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:10:06,215 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:10:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:10:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:10:06,229 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:06,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:06,231 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:10:06,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:06,236 INFO L82 PathProgramCache]: Analyzing trace with hash -37667266, now seen corresponding path program 1 times [2018-11-23 13:10:06,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:06,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:06,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:06,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:06,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:06,337 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 13:10:06,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:06,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:10:06,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:10:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:10:06,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:10:06,354 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 4 states. [2018-11-23 13:10:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:06,402 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-11-23 13:10:06,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:10:06,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-11-23 13:10:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:06,411 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:10:06,411 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:10:06,413 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 13:10:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:10:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:10:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:10:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:10:06,439 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2018-11-23 13:10:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:06,439 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:10:06,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:10:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:10:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:10:06,440 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:06,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:06,440 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:10:06,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:06,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1167685199, now seen corresponding path program 1 times [2018-11-23 13:10:06,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:06,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:06,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:06,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:06,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:06,474 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 13:10:06,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:06,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:10:06,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:10:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:10:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:10:06,477 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2018-11-23 13:10:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:06,524 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:10:06,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:10:06,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-11-23 13:10:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:06,525 INFO L225 Difference]: With dead ends: 13 [2018-11-23 13:10:06,525 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:10:06,526 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 13:10:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:10:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:10:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:10:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:10:06,529 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2018-11-23 13:10:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:06,529 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:10:06,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:10:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:10:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:10:06,530 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:06,530 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:06,530 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:10:06,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:06,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1838502752, now seen corresponding path program 1 times [2018-11-23 13:10:06,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:06,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:06,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:06,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:10:06,560 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 13:10:06,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:10:06,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:10:06,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:10:06,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:10:06,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:10:06,561 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-23 13:10:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:10:06,570 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:10:06,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:10:06,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 13:10:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:10:06,570 INFO L225 Difference]: With dead ends: 13 [2018-11-23 13:10:06,571 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:10:06,571 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 13:10:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:10:06,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-11-23 13:10:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 13:10:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 13:10:06,573 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-11-23 13:10:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:10:06,574 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-11-23 13:10:06,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:10:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 13:10:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:10:06,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:10:06,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:10:06,575 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 13:10:06,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:10:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1159010413, now seen corresponding path program 1 times [2018-11-23 13:10:06,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:10:06,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:10:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:06,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:10:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:10:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:10:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:10:06,594 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #28#return; [?] CALL call #t~ret2 := main(); [?] havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~x~0=2, main_~y~0=(- 2147483648)] [?] assume !!(~x~0 > 0 && ~y~0 < 0); VAL [main_~x~0=2, main_~y~0=(- 2147483648)] [?] assume ~x~0 + ~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=(- 2147483648)] [?] assume ~x~0 + ~y~0 >= -2147483648;~x~0 := ~x~0 + ~y~0; VAL [main_~x~0=(- 2147483646), main_~y~0=(- 2147483648)] [?] assume ~y~0 - 1 <= 2147483647; VAL [main_~x~0=(- 2147483646), main_~y~0=(- 2147483648)] [?] assume !(~y~0 - 1 >= -2147483648); VAL [main_~x~0=(- 2147483646), main_~y~0=(- 2147483648)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] assume !!(~x~0 > 0 && ~y~0 < 0); VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] assume !!(~x~0 > 0 && ~y~0 < 0); VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] COND FALSE !(!(~x~0 > 0 && ~y~0 < 0)) VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] COND FALSE !(!(~x~0 > 0 && ~y~0 < 0)) VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] COND FALSE !(!(~x~0 > 0 && ~y~0 < 0)) VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] COND FALSE !(!(~x~0 > 0 && ~y~0 < 0)) VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L23] int x, y; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] COND TRUE x > 0 && y < 0 VAL [x=2, y=-2147483648] [L27] EXPR x + y [L27] x = x + y VAL [x=-2147483646, y=-2147483648] [L28] y - 1 VAL [x=-2147483646, y=-2147483648] ----- [2018-11-23 13:10:06,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:10:06 BoogieIcfgContainer [2018-11-23 13:10:06,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:10:06,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:10:06,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:10:06,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:10:06,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:10:06" (3/4) ... [2018-11-23 13:10:06,617 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #28#return; [?] CALL call #t~ret2 := main(); [?] havoc ~x~0;havoc ~y~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~x~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~y~0 := #t~nondet1;havoc #t~nondet1; VAL [main_~x~0=2, main_~y~0=(- 2147483648)] [?] assume !!(~x~0 > 0 && ~y~0 < 0); VAL [main_~x~0=2, main_~y~0=(- 2147483648)] [?] assume ~x~0 + ~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=(- 2147483648)] [?] assume ~x~0 + ~y~0 >= -2147483648;~x~0 := ~x~0 + ~y~0; VAL [main_~x~0=(- 2147483646), main_~y~0=(- 2147483648)] [?] assume ~y~0 - 1 <= 2147483647; VAL [main_~x~0=(- 2147483646), main_~y~0=(- 2147483648)] [?] assume !(~y~0 - 1 >= -2147483648); VAL [main_~x~0=(- 2147483646), main_~y~0=(- 2147483648)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] assume !!(~x~0 > 0 && ~y~0 < 0); VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] assume !!(~x~0 > 0 && ~y~0 < 0); VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] COND FALSE !(!(~x~0 > 0 && ~y~0 < 0)) VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] COND FALSE !(!(~x~0 > 0 && ~y~0 < 0)) VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] COND FALSE !(!(~x~0 > 0 && ~y~0 < 0)) VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret2 := main(); [L23] havoc ~x~0; [L23] havoc ~y~0; [L24] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L24] ~x~0 := #t~nondet0; [L24] havoc #t~nondet0; [L25] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L25] ~y~0 := #t~nondet1; [L25] havoc #t~nondet1; VAL [~x~0=2, ~y~0=-2147483648] [L26-L29] COND FALSE !(!(~x~0 > 0 && ~y~0 < 0)) VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=-2147483648] [L27] assert ~x~0 + ~y~0 >= -2147483648; [L27] ~x~0 := ~x~0 + ~y~0; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 <= 2147483647; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L28] assert ~y~0 - 1 >= -2147483648; VAL [~x~0=-2147483646, ~y~0=-2147483648] [L23] int x, y; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] COND TRUE x > 0 && y < 0 VAL [x=2, y=-2147483648] [L27] EXPR x + y [L27] x = x + y VAL [x=-2147483646, y=-2147483648] [L28] y - 1 VAL [x=-2147483646, y=-2147483648] ----- [2018-11-23 13:10:06,648 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f5d7dbcf-5e90-43b5-bbc7-0cc274d8432e/bin-2019/uautomizer/witness.graphml [2018-11-23 13:10:06,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:10:06,649 INFO L168 Benchmark]: Toolchain (without parser) took 847.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -115.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:10:06,649 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:10:06,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.93 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:10:06,650 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.22 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:10:06,651 INFO L168 Benchmark]: Boogie Preprocessor took 11.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:10:06,651 INFO L168 Benchmark]: RCFGBuilder took 166.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:10:06,651 INFO L168 Benchmark]: TraceAbstraction took 452.21 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: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:10:06,652 INFO L168 Benchmark]: Witness Printer took 33.14 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:10:06,654 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.93 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 951.2 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 12.22 ms. Allocated memory is still 1.0 GB. Free memory is still 951.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.41 ms. Allocated memory is still 1.0 GB. Free memory was 951.2 MB in the beginning and 945.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 166.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -175.8 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 452.21 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: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 11.5 GB. * Witness Printer took 33.14 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 28]: integer overflow possible integer overflow possible We found a FailurePath: [L23] int x, y; [L24] x = __VERIFIER_nondet_int() [L25] y = __VERIFIER_nondet_int() [L26] COND TRUE x > 0 && y < 0 VAL [x=2, y=-2147483648] [L27] EXPR x + y [L27] x = x + y VAL [x=-2147483646, y=-2147483648] [L28] y - 1 VAL [x=-2147483646, y=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 4 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 19 SDslu, 26 SDs, 0 SdLazy, 31 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...