./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/Ben-Amram-LMCS2010-Ex2.3_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_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/Ben-Amram-LMCS2010-Ex2.3_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/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 914e210bb2ee753bbbdbfa23a6e9397216225fad ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:34:08,401 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:34:08,402 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:34:08,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:34:08,409 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:34:08,410 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:34:08,411 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:34:08,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:34:08,413 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:34:08,413 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:34:08,414 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:34:08,414 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:34:08,415 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:34:08,416 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:34:08,416 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:34:08,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:34:08,417 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:34:08,418 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:34:08,419 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:34:08,420 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:34:08,420 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:34:08,421 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:34:08,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:34:08,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:34:08,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:34:08,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:34:08,423 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:34:08,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:34:08,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:34:08,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:34:08,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:34:08,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:34:08,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:34:08,426 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:34:08,427 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:34:08,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:34:08,427 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-11-22 22:34:08,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:34:08,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:34:08,435 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:34:08,435 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:34:08,436 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:34:08,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:34:08,436 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:34:08,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:34:08,436 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:34:08,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:34:08,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:34:08,437 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:34:08,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:34:08,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:34:08,437 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-22 22:34:08,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:34:08,437 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:34:08,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:34:08,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:34:08,438 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:34:08,438 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:34:08,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:34:08,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:34:08,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:34:08,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:34:08,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:34:08,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:34:08,439 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:34:08,439 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:34:08,439 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_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/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 -> 914e210bb2ee753bbbdbfa23a6e9397216225fad [2018-11-22 22:34:08,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:34:08,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:34:08,474 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:34:08,475 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:34:08,476 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:34:08,476 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/Ben-Amram-LMCS2010-Ex2.3_false-no-overflow.c [2018-11-22 22:34:08,523 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/data/e4ea28493/2730343d71ba4874af62b7180b326da6/FLAG8ee6ac9c3 [2018-11-22 22:34:08,853 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:34:08,853 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/sv-benchmarks/c/termination-crafted-lit/Ben-Amram-LMCS2010-Ex2.3_false-no-overflow.c [2018-11-22 22:34:08,859 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/data/e4ea28493/2730343d71ba4874af62b7180b326da6/FLAG8ee6ac9c3 [2018-11-22 22:34:09,284 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/data/e4ea28493/2730343d71ba4874af62b7180b326da6 [2018-11-22 22:34:09,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:34:09,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:34:09,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:34:09,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:34:09,292 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:34:09,293 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8670d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09, skipping insertion in model container [2018-11-22 22:34:09,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:34:09,317 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:34:09,420 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:34:09,422 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:34:09,433 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:34:09,441 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:34:09,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09 WrapperNode [2018-11-22 22:34:09,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:34:09,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:34:09,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:34:09,443 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:34:09,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,453 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,457 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:34:09,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:34:09,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:34:09,458 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:34:09,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... [2018-11-22 22:34:09,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:34:09,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:34:09,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:34:09,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:34:09,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/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-22 22:34:09,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:34:09,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:34:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:34:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:34:09,550 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:34:09,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:34:09,668 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:34:09,668 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 22:34:09,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:34:09 BoogieIcfgContainer [2018-11-22 22:34:09,668 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:34:09,669 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:34:09,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:34:09,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:34:09,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:34:09" (1/3) ... [2018-11-22 22:34:09,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c94512e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:34:09, skipping insertion in model container [2018-11-22 22:34:09,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:34:09" (2/3) ... [2018-11-22 22:34:09,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c94512e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:34:09, skipping insertion in model container [2018-11-22 22:34:09,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:34:09" (3/3) ... [2018-11-22 22:34:09,675 INFO L112 eAbstractionObserver]: Analyzing ICFG Ben-Amram-LMCS2010-Ex2.3_false-no-overflow.c [2018-11-22 22:34:09,680 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:34:09,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-11-22 22:34:09,695 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-11-22 22:34:09,726 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:34:09,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:34:09,727 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:34:09,727 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:34:09,727 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:34:09,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:34:09,727 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:34:09,727 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:34:09,727 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:34:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-22 22:34:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-22 22:34:09,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:34:09,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:34:09,752 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:34:09,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:34:09,756 INFO L82 PathProgramCache]: Analyzing trace with hash -623924281, now seen corresponding path program 1 times [2018-11-22 22:34:09,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:34:09,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:34:09,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:34:09,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:34:09,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:34:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:34:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:34:09,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:34:09,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:34:09,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:34:09,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:34:09,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:34:09,881 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-11-22 22:34:09,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:34:09,932 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-22 22:34:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:34:09,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-22 22:34:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:34:09,941 INFO L225 Difference]: With dead ends: 29 [2018-11-22 22:34:09,941 INFO L226 Difference]: Without dead ends: 17 [2018-11-22 22:34:09,943 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-22 22:34:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-22 22:34:09,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-22 22:34:09,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-22 22:34:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-22 22:34:09,978 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 8 [2018-11-22 22:34:09,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:34:09,978 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-22 22:34:09,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:34:09,979 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-22 22:34:09,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-22 22:34:09,979 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:34:09,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:34:09,980 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:34:09,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:34:09,981 INFO L82 PathProgramCache]: Analyzing trace with hash -623924089, now seen corresponding path program 1 times [2018-11-22 22:34:09,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:34:09,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:34:09,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:34:09,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:34:09,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:34:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:34:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:34:10,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:34:10,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:34:10,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:34:10,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:34:10,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:34:10,020 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 3 states. [2018-11-22 22:34:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:34:10,057 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-22 22:34:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:34:10,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-22 22:34:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:34:10,058 INFO L225 Difference]: With dead ends: 28 [2018-11-22 22:34:10,058 INFO L226 Difference]: Without dead ends: 27 [2018-11-22 22:34:10,058 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-22 22:34:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-22 22:34:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-22 22:34:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 22:34:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-22 22:34:10,062 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 8 [2018-11-22 22:34:10,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:34:10,062 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-22 22:34:10,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:34:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-11-22 22:34:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-22 22:34:10,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:34:10,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:34:10,063 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:34:10,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:34:10,064 INFO L82 PathProgramCache]: Analyzing trace with hash 2133183819, now seen corresponding path program 1 times [2018-11-22 22:34:10,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:34:10,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:34:10,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:34:10,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:34:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:34:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:34:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:34:10,101 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #38#return; [?] CALL call #t~ret5 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~z~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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~z~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~x~0=2, main_~y~0=3, main_~z~0=1] [?] assume !!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0); VAL [main_~x~0=2, main_~y~0=3, main_~z~0=1] [?] assume ~y~0 > ~x~0;~y~0 := ~z~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~x~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~x~0=(- 2147483648), main_~y~0=1, main_~z~0=1] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 2147483648), main_~y~0=1, main_~z~0=1] [?] assume !(~x~0 - 1 >= -2147483648); VAL [main_~x~0=(- 2147483648), main_~y~0=1, main_~z~0=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] assume !!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0); VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21-L29] assume ~y~0 > ~x~0; [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] assume !!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0); VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21-L29] assume ~y~0 > ~x~0; [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] COND FALSE !(!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0)) VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21] COND TRUE ~y~0 > ~x~0 [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] COND FALSE !(!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0)) VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21] COND TRUE ~y~0 > ~x~0 [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] COND FALSE !(!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0)) VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21] COND TRUE ~y~0 > ~x~0 [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] COND FALSE !(!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0)) VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21] COND TRUE ~y~0 > ~x~0 [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L15] int x, y, z; [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L20] COND TRUE x > 0 && y > 0 && z > 0 VAL [x=2, y=3, z=1] [L21] COND TRUE y > x [L22] y = z [L23] x = __VERIFIER_nondet_int() [L24] x - 1 VAL [x=-2147483648, y=1, z=1] ----- [2018-11-22 22:34:10,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:34:10 BoogieIcfgContainer [2018-11-22 22:34:10,125 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 22:34:10,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:34:10,126 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:34:10,126 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:34:10,126 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:34:09" (3/4) ... [2018-11-22 22:34:10,129 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 #38#return; [?] CALL call #t~ret5 := main(); [?] havoc ~x~0;havoc ~y~0;havoc ~z~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;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~z~0 := #t~nondet2;havoc #t~nondet2; VAL [main_~x~0=2, main_~y~0=3, main_~z~0=1] [?] assume !!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0); VAL [main_~x~0=2, main_~y~0=3, main_~z~0=1] [?] assume ~y~0 > ~x~0;~y~0 := ~z~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~x~0 := #t~nondet3;havoc #t~nondet3; VAL [main_~x~0=(- 2147483648), main_~y~0=1, main_~z~0=1] [?] assume ~x~0 - 1 <= 2147483647; VAL [main_~x~0=(- 2147483648), main_~y~0=1, main_~z~0=1] [?] assume !(~x~0 - 1 >= -2147483648); VAL [main_~x~0=(- 2147483648), main_~y~0=1, main_~z~0=1] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] assume !!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0); VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21-L29] assume ~y~0 > ~x~0; [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] assume !!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0); VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21-L29] assume ~y~0 > ~x~0; [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] COND FALSE !(!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0)) VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21] COND TRUE ~y~0 > ~x~0 [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] COND FALSE !(!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0)) VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21] COND TRUE ~y~0 > ~x~0 [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] COND FALSE !(!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0)) VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21] COND TRUE ~y~0 > ~x~0 [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret5 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L15] havoc ~z~0; [L16] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L16] ~x~0 := #t~nondet0; [L16] havoc #t~nondet0; [L17] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L17] ~y~0 := #t~nondet1; [L17] havoc #t~nondet1; [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] ~z~0 := #t~nondet2; [L18] havoc #t~nondet2; VAL [~x~0=2, ~y~0=3, ~z~0=1] [L20-L30] COND FALSE !(!((~x~0 > 0 && ~y~0 > 0) && ~z~0 > 0)) VAL [~x~0=2, ~y~0=3, ~z~0=1] [L21] COND TRUE ~y~0 > ~x~0 [L22] ~y~0 := ~z~0; [L23] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L23] ~x~0 := #t~nondet3; [L23] havoc #t~nondet3; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 <= 2147483647; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L24] assert ~x~0 - 1 >= -2147483648; VAL [~x~0=-2147483648, ~y~0=1, ~z~0=1] [L15] int x, y, z; [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L20] COND TRUE x > 0 && y > 0 && z > 0 VAL [x=2, y=3, z=1] [L21] COND TRUE y > x [L22] y = z [L23] x = __VERIFIER_nondet_int() [L24] x - 1 VAL [x=-2147483648, y=1, z=1] ----- [2018-11-22 22:34:10,161 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_005b0ac1-89b4-4be2-b9f5-d7ccd28b7172/bin-2019/uautomizer/witness.graphml [2018-11-22 22:34:10,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:34:10,162 INFO L168 Benchmark]: Toolchain (without parser) took 875.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:10,164 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:34:10,164 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.68 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:10,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.15 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:10,165 INFO L168 Benchmark]: Boogie Preprocessor took 12.87 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:34:10,166 INFO L168 Benchmark]: RCFGBuilder took 197.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:10,166 INFO L168 Benchmark]: TraceAbstraction took 456.65 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:10,166 INFO L168 Benchmark]: Witness Printer took 36.02 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-22 22:34:10,169 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.68 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 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 15.15 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.87 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 197.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 456.65 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: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Witness Printer took 36.02 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: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L15] int x, y, z; [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L20] COND TRUE x > 0 && y > 0 && z > 0 VAL [x=2, y=3, z=1] [L21] COND TRUE y > x [L22] y = z [L23] x = __VERIFIER_nondet_int() [L24] x - 1 VAL [x=-2147483648, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 24 locations, 6 error locations. UNSAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26 SDtfs, 22 SDslu, 16 SDs, 0 SdLazy, 21 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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...