./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3_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_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c49ca63b076bdfdfd4da2b39429bac3c0da8332d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 01:15:02,546 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 01:15:02,547 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 01:15:02,553 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 01:15:02,553 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 01:15:02,554 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 01:15:02,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 01:15:02,556 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 01:15:02,557 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 01:15:02,558 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 01:15:02,558 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 01:15:02,559 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 01:15:02,559 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 01:15:02,560 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 01:15:02,560 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 01:15:02,561 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 01:15:02,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 01:15:02,562 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 01:15:02,563 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 01:15:02,564 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 01:15:02,565 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 01:15:02,566 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 01:15:02,568 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 01:15:02,568 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 01:15:02,568 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 01:15:02,568 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 01:15:02,569 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 01:15:02,569 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 01:15:02,570 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 01:15:02,571 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 01:15:02,571 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 01:15:02,571 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 01:15:02,571 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 01:15:02,572 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 01:15:02,572 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 01:15:02,573 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 01:15:02,573 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf [2018-11-23 01:15:02,580 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 01:15:02,580 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 01:15:02,581 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 01:15:02,581 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 01:15:02,581 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 01:15:02,581 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 01:15:02,582 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 01:15:02,582 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 01:15:02,582 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 01:15:02,582 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 01:15:02,582 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 01:15:02,582 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 01:15:02,582 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 01:15:02,583 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 01:15:02,583 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 01:15:02,583 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 01:15:02,583 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 01:15:02,583 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 01:15:02,583 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 01:15:02,583 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 01:15:02,584 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 01:15:02,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 01:15:02,584 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 01:15:02,584 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 01:15:02,584 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 01:15:02,584 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 01:15:02,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 01:15:02,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 01:15:02,585 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_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak 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 -> Kojak 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 -> c49ca63b076bdfdfd4da2b39429bac3c0da8332d [2018-11-23 01:15:02,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 01:15:02,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 01:15:02,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 01:15:02,621 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 01:15:02,621 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 01:15:02,621 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/../../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3_false-no-overflow.c [2018-11-23 01:15:02,666 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/data/f687fe1b9/35b9aecfd7de40d2ac3bdac9fe282113/FLAG57ed9049e [2018-11-23 01:15:03,058 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 01:15:03,059 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig3_false-no-overflow.c [2018-11-23 01:15:03,063 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/data/f687fe1b9/35b9aecfd7de40d2ac3bdac9fe282113/FLAG57ed9049e [2018-11-23 01:15:03,073 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/data/f687fe1b9/35b9aecfd7de40d2ac3bdac9fe282113 [2018-11-23 01:15:03,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 01:15:03,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 01:15:03,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 01:15:03,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 01:15:03,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 01:15:03,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb3b58b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03, skipping insertion in model container [2018-11-23 01:15:03,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 01:15:03,098 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 01:15:03,205 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:15:03,207 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 01:15:03,216 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 01:15:03,223 INFO L195 MainTranslator]: Completed translation [2018-11-23 01:15:03,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03 WrapperNode [2018-11-23 01:15:03,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 01:15:03,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 01:15:03,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 01:15:03,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 01:15:03,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 01:15:03,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 01:15:03,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 01:15:03,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 01:15:03,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 01:15:03,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 01:15:03,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 01:15:03,253 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 01:15:03,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:15:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 01:15:03,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 01:15:03,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 01:15:03,438 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 01:15:03,439 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 01:15:03,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:03 BoogieIcfgContainer [2018-11-23 01:15:03,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 01:15:03,439 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 01:15:03,439 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 01:15:03,447 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 01:15:03,447 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:03" (1/1) ... [2018-11-23 01:15:03,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 01:15:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 16 states and 17 transitions. [2018-11-23 01:15:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 01:15:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 01:15:03,485 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:15:03,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 19 states and 24 transitions. [2018-11-23 01:15:03,639 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-11-23 01:15:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 01:15:03,639 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:03,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:15:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 22 states and 31 transitions. [2018-11-23 01:15:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-11-23 01:15:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 01:15:03,875 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:15:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 24 states and 34 transitions. [2018-11-23 01:15:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-11-23 01:15:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 01:15:04,012 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 01:15:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 01:15:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 01:15:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 26 states and 37 transitions. [2018-11-23 01:15:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-11-23 01:15:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 01:15:04,139 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 01:15:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:15:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:15:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:15:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 01:15:04,168 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 5 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~x~0=2147483647, ULTIMATE.start_main_~y~0=1] [?] assume !!(main_~x~0 > 0 && main_~y~0 > 0);main_~old_x~0 := main_~x~0;main_~old_y~0 := main_~y~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=2147483647, ULTIMATE.start_main_~y~0=1, |ULTIMATE.start_main_#t~nondet2|=0] [?] assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=2147483647, ULTIMATE.start_main_~y~0=1] [?] assume main_~old_y~0 - 2 <= 2147483647; VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=2147483647, ULTIMATE.start_main_~y~0=1] [?] assume main_~old_y~0 - 2 >= -2147483648;main_~x~0 := main_~old_y~0 - 2; VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=1] [?] assume !(1 + main_~old_x~0 <= 2147483647); VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=1] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~x~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; [L13] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L13] main_~y~0 := main_#t~nondet1; [L13] havoc main_#t~nondet1; VAL [main_~x~0=2147483647, main_~y~0=1] [L14-L24] assume !!(main_~x~0 > 0 && main_~y~0 > 0); [L15] main_~old_x~0 := main_~x~0; [L16] main_~old_y~0 := main_~y~0; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [main_#t~nondet2=0, main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L17-L23] assume !(0 != main_#t~nondet2); [L17] havoc main_#t~nondet2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 >= -2147483648; [L21] main_~x~0 := main_~old_y~0 - 2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L22] assert 1 + main_~old_x~0 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~x~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; [L13] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L13] main_~y~0 := main_#t~nondet1; [L13] havoc main_#t~nondet1; VAL [main_~x~0=2147483647, main_~y~0=1] [L14-L24] assume !!(main_~x~0 > 0 && main_~y~0 > 0); [L15] main_~old_x~0 := main_~x~0; [L16] main_~old_y~0 := main_~y~0; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [main_#t~nondet2=0, main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L17-L23] assume !(0 != main_#t~nondet2); [L17] havoc main_#t~nondet2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 >= -2147483648; [L21] main_~x~0 := main_~old_y~0 - 2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L22] assert 1 + main_~old_x~0 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~x~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; [L13] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L13] main_~y~0 := main_#t~nondet1; [L13] havoc main_#t~nondet1; VAL [main_~x~0=2147483647, main_~y~0=1] [L14-L24] COND FALSE !(!(main_~x~0 > 0 && main_~y~0 > 0)) [L15] main_~old_x~0 := main_~x~0; [L16] main_~old_y~0 := main_~y~0; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [main_#t~nondet2=0, main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L17-L23] COND FALSE !(0 != main_#t~nondet2) [L17] havoc main_#t~nondet2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 >= -2147483648; [L21] main_~x~0 := main_~old_y~0 - 2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L22] assert 1 + main_~old_x~0 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~x~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; [L13] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L13] main_~y~0 := main_#t~nondet1; [L13] havoc main_#t~nondet1; VAL [main_~x~0=2147483647, main_~y~0=1] [L14-L24] COND FALSE !(!(main_~x~0 > 0 && main_~y~0 > 0)) [L15] main_~old_x~0 := main_~x~0; [L16] main_~old_y~0 := main_~y~0; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [main_#t~nondet2=0, main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L17-L23] COND FALSE !(0 != main_#t~nondet2) [L17] havoc main_#t~nondet2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 >= -2147483648; [L21] main_~x~0 := main_~old_y~0 - 2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L22] assert 1 + main_~old_x~0 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~x~0 := #t~nondet0; [L12] havoc #t~nondet0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~y~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14-L24] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L15] ~old_x~0 := ~x~0; [L16] ~old_y~0 := ~y~0; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17-L23] COND FALSE !(0 != #t~nondet2) [L17] havoc #t~nondet2; [L21] assert ~old_y~0 - 2 <= 2147483647; [L21] assert ~old_y~0 - 2 >= -2147483648; [L21] ~x~0 := ~old_y~0 - 2; [L22] assert 1 + ~old_x~0 <= 2147483647; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~x~0 := #t~nondet0; [L12] havoc #t~nondet0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~y~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14-L24] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L15] ~old_x~0 := ~x~0; [L16] ~old_y~0 := ~y~0; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17-L23] COND FALSE !(0 != #t~nondet2) [L17] havoc #t~nondet2; [L21] assert ~old_y~0 - 2 <= 2147483647; [L21] assert ~old_y~0 - 2 >= -2147483648; [L21] ~x~0 := ~old_y~0 - 2; [L22] assert 1 + ~old_x~0 <= 2147483647; [L12] int x = __VERIFIER_nondet_int(); [L13] int y = __VERIFIER_nondet_int(); [L14] COND TRUE x > 0 && y > 0 [L15] int old_x = x; [L16] int old_y = y; [L17] COND FALSE !(__VERIFIER_nondet_int()) [L21] EXPR old_y - 2 [L21] x = old_y - 2 [L22] old_x + 1 ----- [2018-11-23 01:15:04,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:15:04 ImpRootNode [2018-11-23 01:15:04,196 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 01:15:04,197 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 01:15:04,197 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 01:15:04,197 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 01:15:04,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:15:03" (3/4) ... [2018-11-23 01:15:04,199 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~x~0=2147483647, ULTIMATE.start_main_~y~0=1] [?] assume !!(main_~x~0 > 0 && main_~y~0 > 0);main_~old_x~0 := main_~x~0;main_~old_y~0 := main_~y~0;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=2147483647, ULTIMATE.start_main_~y~0=1, |ULTIMATE.start_main_#t~nondet2|=0] [?] assume !(0 != main_#t~nondet2);havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=2147483647, ULTIMATE.start_main_~y~0=1] [?] assume main_~old_y~0 - 2 <= 2147483647; VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=2147483647, ULTIMATE.start_main_~y~0=1] [?] assume main_~old_y~0 - 2 >= -2147483648;main_~x~0 := main_~old_y~0 - 2; VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=1] [?] assume !(1 + main_~old_x~0 <= 2147483647); VAL [ULTIMATE.start_main_~old_x~0=2147483647, ULTIMATE.start_main_~old_y~0=1, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=1] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~x~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; [L13] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L13] main_~y~0 := main_#t~nondet1; [L13] havoc main_#t~nondet1; VAL [main_~x~0=2147483647, main_~y~0=1] [L14-L24] assume !!(main_~x~0 > 0 && main_~y~0 > 0); [L15] main_~old_x~0 := main_~x~0; [L16] main_~old_y~0 := main_~y~0; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [main_#t~nondet2=0, main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L17-L23] assume !(0 != main_#t~nondet2); [L17] havoc main_#t~nondet2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 >= -2147483648; [L21] main_~x~0 := main_~old_y~0 - 2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L22] assert 1 + main_~old_x~0 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~x~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; [L13] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L13] main_~y~0 := main_#t~nondet1; [L13] havoc main_#t~nondet1; VAL [main_~x~0=2147483647, main_~y~0=1] [L14-L24] assume !!(main_~x~0 > 0 && main_~y~0 > 0); [L15] main_~old_x~0 := main_~x~0; [L16] main_~old_y~0 := main_~y~0; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [main_#t~nondet2=0, main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L17-L23] assume !(0 != main_#t~nondet2); [L17] havoc main_#t~nondet2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 >= -2147483648; [L21] main_~x~0 := main_~old_y~0 - 2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L22] assert 1 + main_~old_x~0 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~x~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; [L13] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L13] main_~y~0 := main_#t~nondet1; [L13] havoc main_#t~nondet1; VAL [main_~x~0=2147483647, main_~y~0=1] [L14-L24] COND FALSE !(!(main_~x~0 > 0 && main_~y~0 > 0)) [L15] main_~old_x~0 := main_~x~0; [L16] main_~old_y~0 := main_~y~0; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [main_#t~nondet2=0, main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L17-L23] COND FALSE !(0 != main_#t~nondet2) [L17] havoc main_#t~nondet2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 >= -2147483648; [L21] main_~x~0 := main_~old_y~0 - 2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L22] assert 1 + main_~old_x~0 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~old_x~0, main_~old_y~0, main_~x~0, main_~y~0; [L12] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L12] main_~x~0 := main_#t~nondet0; [L12] havoc main_#t~nondet0; [L13] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L13] main_~y~0 := main_#t~nondet1; [L13] havoc main_#t~nondet1; VAL [main_~x~0=2147483647, main_~y~0=1] [L14-L24] COND FALSE !(!(main_~x~0 > 0 && main_~y~0 > 0)) [L15] main_~old_x~0 := main_~x~0; [L16] main_~old_y~0 := main_~y~0; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; VAL [main_#t~nondet2=0, main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L17-L23] COND FALSE !(0 != main_#t~nondet2) [L17] havoc main_#t~nondet2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=2147483647, main_~y~0=1] [L21] assert main_~old_y~0 - 2 >= -2147483648; [L21] main_~x~0 := main_~old_y~0 - 2; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L22] assert 1 + main_~old_x~0 <= 2147483647; VAL [main_~old_x~0=2147483647, main_~old_y~0=1, main_~x~0=-1, main_~y~0=1] [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~x~0 := #t~nondet0; [L12] havoc #t~nondet0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~y~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14-L24] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L15] ~old_x~0 := ~x~0; [L16] ~old_y~0 := ~y~0; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17-L23] COND FALSE !(0 != #t~nondet2) [L17] havoc #t~nondet2; [L21] assert ~old_y~0 - 2 <= 2147483647; [L21] assert ~old_y~0 - 2 >= -2147483648; [L21] ~x~0 := ~old_y~0 - 2; [L22] assert 1 + ~old_x~0 <= 2147483647; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L12] ~x~0 := #t~nondet0; [L12] havoc #t~nondet0; [L13] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L13] ~y~0 := #t~nondet1; [L13] havoc #t~nondet1; [L14-L24] COND FALSE !(!(~x~0 > 0 && ~y~0 > 0)) [L15] ~old_x~0 := ~x~0; [L16] ~old_y~0 := ~y~0; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17-L23] COND FALSE !(0 != #t~nondet2) [L17] havoc #t~nondet2; [L21] assert ~old_y~0 - 2 <= 2147483647; [L21] assert ~old_y~0 - 2 >= -2147483648; [L21] ~x~0 := ~old_y~0 - 2; [L22] assert 1 + ~old_x~0 <= 2147483647; [L12] int x = __VERIFIER_nondet_int(); [L13] int y = __VERIFIER_nondet_int(); [L14] COND TRUE x > 0 && y > 0 [L15] int old_x = x; [L16] int old_y = y; [L17] COND FALSE !(__VERIFIER_nondet_int()) [L21] EXPR old_y - 2 [L21] x = old_y - 2 [L22] old_x + 1 ----- [2018-11-23 01:15:04,236 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4352c321-0aae-41a6-bedf-17862558899a/bin-2019/ukojak/witness.graphml [2018-11-23 01:15:04,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 01:15:04,236 INFO L168 Benchmark]: Toolchain (without parser) took 1160.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 963.0 MB in the beginning and 1.0 GB in the end (delta: -45.9 MB). Peak memory consumption was 89.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:04,237 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:15:04,238 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.95 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:04,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.16 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:04,239 INFO L168 Benchmark]: Boogie Preprocessor took 10.18 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:15:04,239 INFO L168 Benchmark]: RCFGBuilder took 186.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:04,240 INFO L168 Benchmark]: CodeCheck took 757.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.2 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. [2018-11-23 01:15:04,240 INFO L168 Benchmark]: Witness Printer took 39.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 01:15:04,242 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 19 locations, 6 error locations. UNSAFE Result, 0.7s OverallTime, 5 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 48 SDtfs, 62 SDslu, 116 SDs, 0 SdLazy, 272 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L12] int x = __VERIFIER_nondet_int(); [L13] int y = __VERIFIER_nondet_int(); [L14] COND TRUE x > 0 && y > 0 [L15] int old_x = x; [L16] int old_y = y; [L17] COND FALSE !(__VERIFIER_nondet_int()) [L21] EXPR old_y - 2 [L21] x = old_y - 2 [L22] old_x + 1 * 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 146.95 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 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 18.16 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.18 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 186.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -174.2 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * CodeCheck took 757.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.2 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. * Witness Printer took 39.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...