./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-aaron4_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_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-aaron4_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/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 4d735b86941b4b144f047f65c32e604089b6d2a0 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:10:47,463 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:10:47,464 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:10:47,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:10:47,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:10:47,472 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:10:47,473 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:10:47,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:10:47,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:10:47,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:10:47,476 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:10:47,476 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:10:47,477 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:10:47,477 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:10:47,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:10:47,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:10:47,479 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:10:47,480 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:10:47,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:10:47,482 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:10:47,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:10:47,484 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:10:47,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:10:47,486 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:10:47,486 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:10:47,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:10:47,487 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:10:47,488 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:10:47,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:10:47,489 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:10:47,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:10:47,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:10:47,490 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:10:47,490 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:10:47,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:10:47,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:10:47,491 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-23 06:10:47,501 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:10:47,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:10:47,501 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:10:47,502 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:10:47,502 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:10:47,502 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:10:47,502 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 06:10:47,502 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:10:47,503 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:10:47,503 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:10:47,503 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:10:47,503 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 06:10:47,503 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:10:47,503 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 06:10:47,503 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 06:10:47,503 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 06:10:47,504 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:10:47,504 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 06:10:47,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:10:47,504 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:10:47,504 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:10:47,504 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:10:47,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:10:47,505 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:10:47,505 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:10:47,505 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 06:10:47,505 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 06:10:47,505 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:10:47,505 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:10:47,505 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_d5bdf807-ef84-425b-b58e-b5c1551a347b/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 -> 4d735b86941b4b144f047f65c32e604089b6d2a0 [2018-11-23 06:10:47,527 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:10:47,536 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:10:47,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:10:47,539 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:10:47,540 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:10:47,540 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-aaron4_false-no-overflow.c [2018-11-23 06:10:47,575 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/data/92b67987a/b73b197f807f462d8391d6fc4e4f1322/FLAGf6f3c5bc1 [2018-11-23 06:10:47,985 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:10:47,985 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/sv-benchmarks/c/termination-crafted-lit/ChawdharyCookGulwaniSagivYang-ESOP2008-aaron4_false-no-overflow.c [2018-11-23 06:10:47,989 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/data/92b67987a/b73b197f807f462d8391d6fc4e4f1322/FLAGf6f3c5bc1 [2018-11-23 06:10:47,998 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/data/92b67987a/b73b197f807f462d8391d6fc4e4f1322 [2018-11-23 06:10:48,001 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:10:48,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:10:48,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:10:48,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:10:48,006 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:10:48,007 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:10:47" (1/1) ... [2018-11-23 06:10:48,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cfd07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48, skipping insertion in model container [2018-11-23 06:10:48,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:10:47" (1/1) ... [2018-11-23 06:10:48,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:10:48,031 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:10:48,137 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:10:48,140 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:10:48,151 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:10:48,158 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:10:48,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48 WrapperNode [2018-11-23 06:10:48,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:10:48,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:10:48,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:10:48,159 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:10:48,164 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:10:48" (1/1) ... [2018-11-23 06:10:48,167 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:10:48" (1/1) ... [2018-11-23 06:10:48,171 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:10:48,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:10:48,172 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:10:48,172 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:10:48,177 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48" (1/1) ... [2018-11-23 06:10:48,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48" (1/1) ... [2018-11-23 06:10:48,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48" (1/1) ... [2018-11-23 06:10:48,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48" (1/1) ... [2018-11-23 06:10:48,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48" (1/1) ... [2018-11-23 06:10:48,185 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48" (1/1) ... [2018-11-23 06:10:48,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48" (1/1) ... [2018-11-23 06:10:48,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:10:48,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:10:48,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:10:48,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:10:48,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/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:10:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:10:48,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:10:48,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:10:48,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:10:48,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:10:48,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:10:48,394 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:10:48,394 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 06:10:48,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:10:48 BoogieIcfgContainer [2018-11-23 06:10:48,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:10:48,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:10:48,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:10:48,398 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:10:48,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:10:47" (1/3) ... [2018-11-23 06:10:48,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7836d5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:10:48, skipping insertion in model container [2018-11-23 06:10:48,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:10:48" (2/3) ... [2018-11-23 06:10:48,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7836d5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:10:48, skipping insertion in model container [2018-11-23 06:10:48,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:10:48" (3/3) ... [2018-11-23 06:10:48,402 INFO L112 eAbstractionObserver]: Analyzing ICFG ChawdharyCookGulwaniSagivYang-ESOP2008-aaron4_false-no-overflow.c [2018-11-23 06:10:48,409 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:10:48,414 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-11-23 06:10:48,425 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-11-23 06:10:48,443 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 06:10:48,444 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:10:48,444 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 06:10:48,444 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:10:48,444 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:10:48,444 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:10:48,444 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:10:48,444 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:10:48,444 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:10:48,456 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-23 06:10:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 06:10:48,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:10:48,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:10:48,461 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 06:10:48,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:10:48,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1515249884, now seen corresponding path program 1 times [2018-11-23 06:10:48,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 06:10:48,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 06:10:48,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:48,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:10:48,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:10:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:10:48,546 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #69#return; [?] CALL call #t~ret10 := main(); [?] havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~an~0;havoc ~bn~0;havoc ~tk~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~an~0 := #t~nondet3;havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~bn~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~tk~0 := #t~nondet5;havoc #t~nondet5; VAL [main_~an~0=0, main_~bn~0=0, main_~i~0=0, main_~j~0=0, main_~k~0=0, main_~tk~0=2147483647] [?] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [main_~an~0=0, main_~bn~0=0, main_~i~0=0, main_~j~0=0, main_~k~0=0, main_~tk~0=2147483647, |main_#t~short6|=true] [?] assume #t~short6; VAL [main_~an~0=0, main_~bn~0=0, main_~i~0=0, main_~j~0=0, main_~k~0=0, main_~tk~0=2147483647, |main_#t~short6|=true] [?] assume !(1 + ~tk~0 <= 2147483647); VAL [main_~an~0=0, main_~bn~0=0, main_~i~0=0, main_~j~0=0, main_~k~0=0, main_~tk~0=2147483647, |main_#t~short6|=true] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assume #t~short6; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assume #t~short6; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] COND TRUE #t~short6 VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] COND TRUE #t~short6 VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] COND TRUE #t~short6 VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] COND TRUE #t~short6 VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L14] int i, j, k, an, bn, tk; [L15] i = __VERIFIER_nondet_int() [L16] j = __VERIFIER_nondet_int() [L17] k = __VERIFIER_nondet_int() [L18] an = __VERIFIER_nondet_int() [L19] bn = __VERIFIER_nondet_int() [L20] tk = __VERIFIER_nondet_int() [L21] ((an >= i && bn >= j) || (an >= i && bn <= j) || (an <= i && bn >= j)) && k >= tk + 1 VAL [((an >= i && bn >= j) || (an >= i && bn <= j) || (an <= i && bn >= j)) && k >= tk + 1=1, an=0, bn=0, i=0, j=0, k=2147483647, k=0] [L21] tk + 1 VAL [((an >= i && bn >= j) || (an >= i && bn <= j) || (an <= i && bn >= j)) && k >= tk + 1=1, an=0, bn=0, i=0, j=0, k=2147483647, k=0] ----- [2018-11-23 06:10:48,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:10:48 BoogieIcfgContainer [2018-11-23 06:10:48,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:10:48,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:10:48,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:10:48,572 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:10:48,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:10:48" (3/4) ... [2018-11-23 06:10:48,573 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 #69#return; [?] CALL call #t~ret10 := main(); [?] havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~an~0;havoc ~bn~0;havoc ~tk~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~i~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~j~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~k~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~an~0 := #t~nondet3;havoc #t~nondet3;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~bn~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~tk~0 := #t~nondet5;havoc #t~nondet5; VAL [main_~an~0=0, main_~bn~0=0, main_~i~0=0, main_~j~0=0, main_~k~0=0, main_~tk~0=2147483647] [?] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [main_~an~0=0, main_~bn~0=0, main_~i~0=0, main_~j~0=0, main_~k~0=0, main_~tk~0=2147483647, |main_#t~short6|=true] [?] assume #t~short6; VAL [main_~an~0=0, main_~bn~0=0, main_~i~0=0, main_~j~0=0, main_~k~0=0, main_~tk~0=2147483647, |main_#t~short6|=true] [?] assume !(1 + ~tk~0 <= 2147483647); VAL [main_~an~0=0, main_~bn~0=0, main_~i~0=0, main_~j~0=0, main_~k~0=0, main_~tk~0=2147483647, |main_#t~short6|=true] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assume #t~short6; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assume #t~short6; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] COND TRUE #t~short6 VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] COND TRUE #t~short6 VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] COND TRUE #t~short6 VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret10 := main(); [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~an~0; [L14] havoc ~bn~0; [L14] havoc ~tk~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L18] ~an~0 := #t~nondet3; [L18] havoc #t~nondet3; [L19] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L19] ~bn~0 := #t~nondet4; [L19] havoc #t~nondet4; [L20] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L20] ~tk~0 := #t~nondet5; [L20] havoc #t~nondet5; VAL [~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] #t~short6 := ((~an~0 >= ~i~0 && ~bn~0 >= ~j~0) || (~an~0 >= ~i~0 && ~bn~0 <= ~j~0)) || (~an~0 <= ~i~0 && ~bn~0 >= ~j~0); VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] COND TRUE #t~short6 VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L21] assert 1 + ~tk~0 <= 2147483647; VAL [#t~short6=true, ~an~0=0, ~bn~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~tk~0=2147483647] [L14] int i, j, k, an, bn, tk; [L15] i = __VERIFIER_nondet_int() [L16] j = __VERIFIER_nondet_int() [L17] k = __VERIFIER_nondet_int() [L18] an = __VERIFIER_nondet_int() [L19] bn = __VERIFIER_nondet_int() [L20] tk = __VERIFIER_nondet_int() [L21] ((an >= i && bn >= j) || (an >= i && bn <= j) || (an <= i && bn >= j)) && k >= tk + 1 VAL [((an >= i && bn >= j) || (an >= i && bn <= j) || (an <= i && bn >= j)) && k >= tk + 1=1, an=0, bn=0, i=0, j=0, k=0, k=2147483647] [L21] tk + 1 VAL [((an >= i && bn >= j) || (an >= i && bn <= j) || (an <= i && bn >= j)) && k >= tk + 1=1, an=0, bn=0, i=0, j=0, k=2147483647, k=0] ----- [2018-11-23 06:10:48,608 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d5bdf807-ef84-425b-b58e-b5c1551a347b/bin-2019/uautomizer/witness.graphml [2018-11-23 06:10:48,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:10:48,609 INFO L168 Benchmark]: Toolchain (without parser) took 607.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 953.8 MB in the beginning and 1.2 GB in the end (delta: -211.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:10:48,610 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:10:48,610 INFO L168 Benchmark]: CACSL2BoogieTranslator took 156.17 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:48,610 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.99 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:48,611 INFO L168 Benchmark]: Boogie Preprocessor took 15.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:10:48,611 INFO L168 Benchmark]: RCFGBuilder took 207.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -246.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:48,612 INFO L168 Benchmark]: TraceAbstraction took 175.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:48,612 INFO L168 Benchmark]: Witness Printer took 36.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-11-23 06:10:48,615 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 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 156.17 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 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 11.99 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 207.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 940.3 MB in the beginning and 1.2 GB in the end (delta: -246.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 175.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Witness Printer took 36.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 21]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int i, j, k, an, bn, tk; [L15] i = __VERIFIER_nondet_int() [L16] j = __VERIFIER_nondet_int() [L17] k = __VERIFIER_nondet_int() [L18] an = __VERIFIER_nondet_int() [L19] bn = __VERIFIER_nondet_int() [L20] tk = __VERIFIER_nondet_int() [L21] ((an >= i && bn >= j) || (an >= i && bn <= j) || (an <= i && bn >= j)) && k >= tk + 1 VAL [((an >= i && bn >= j) || (an >= i && bn <= j) || (an <= i && bn >= j)) && k >= tk + 1=1, an=0, bn=0, i=0, j=0, k=2147483647, k=0] [L21] tk + 1 VAL [((an >= i && bn >= j) || (an >= i && bn <= j) || (an <= i && bn >= j)) && k >= tk + 1=1, an=0, bn=0, i=0, j=0, k=2147483647, k=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 37 locations, 10 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=37occurred 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, 8 NumberOfCodeBlocks, 8 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...