./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b_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_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/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 b51d3ff9a76866bd9c6637bca261a8433dd4524e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 09:34:12,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:34:12,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:34:12,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:34:12,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:34:12,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:34:12,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:34:12,121 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:34:12,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:34:12,122 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:34:12,123 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:34:12,123 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:34:12,124 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:34:12,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:34:12,125 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:34:12,126 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:34:12,126 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:34:12,127 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:34:12,129 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:34:12,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:34:12,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:34:12,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:34:12,133 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:34:12,133 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:34:12,133 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:34:12,134 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:34:12,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:34:12,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:34:12,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:34:12,136 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:34:12,136 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:34:12,137 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:34:12,137 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:34:12,137 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:34:12,138 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:34:12,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:34:12,138 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf [2018-11-23 09:34:12,148 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:34:12,148 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:34:12,149 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:34:12,149 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 09:34:12,150 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:34:12,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:34:12,150 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:34:12,150 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 09:34:12,150 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 09:34:12,150 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:34:12,150 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:34:12,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:34:12,151 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:34:12,151 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 09:34:12,151 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:34:12,151 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:34:12,151 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:34:12,152 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 09:34:12,152 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 09:34:12,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:34:12,152 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:34:12,152 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 09:34:12,152 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:34:12,153 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:34:12,153 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:34:12,153 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 09:34:12,153 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:34:12,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 09:34:12,153 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_a88998ed-e0a9-415a-a230-ae61784b49a8/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 -> b51d3ff9a76866bd9c6637bca261a8433dd4524e [2018-11-23 09:34:12,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:34:12,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:34:12,184 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:34:12,185 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:34:12,185 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:34:12,186 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b_false-no-overflow.c [2018-11-23 09:34:12,228 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/data/6f035f546/e771b48441484d4a8590cc70ec492a55/FLAG69cdb8eac [2018-11-23 09:34:12,619 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:34:12,620 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-counterex1b_false-no-overflow.c [2018-11-23 09:34:12,623 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/data/6f035f546/e771b48441484d4a8590cc70ec492a55/FLAG69cdb8eac [2018-11-23 09:34:12,631 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/data/6f035f546/e771b48441484d4a8590cc70ec492a55 [2018-11-23 09:34:12,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:34:12,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:34:12,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:34:12,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:34:12,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:34:12,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e5f2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12, skipping insertion in model container [2018-11-23 09:34:12,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:34:12,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:34:12,758 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:34:12,760 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:34:12,769 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:34:12,777 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:34:12,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12 WrapperNode [2018-11-23 09:34:12,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:34:12,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:34:12,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:34:12,778 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:34:12,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:34:12,799 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:34:12,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:34:12,799 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:34:12,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... [2018-11-23 09:34:12,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:34:12,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:34:12,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:34:12,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:34:12,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:34:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/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 09:34:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:34:12,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:34:13,058 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:34:13,059 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 09:34:13,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:34:13 BoogieIcfgContainer [2018-11-23 09:34:13,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:34:13,060 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 09:34:13,060 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 09:34:13,069 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 09:34:13,069 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:34:13" (1/1) ... [2018-11-23 09:34:13,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:34:13,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:34:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 19 states and 23 transitions. [2018-11-23 09:34:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2018-11-23 09:34:13,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 09:34:13,114 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:34:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:34:13,184 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 09:34:13,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:34:13,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 19 states and 21 transitions. [2018-11-23 09:34:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-11-23 09:34:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 09:34:13,191 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:34:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:34:13,221 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 09:34:13,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:34:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 23 states and 28 transitions. [2018-11-23 09:34:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2018-11-23 09:34:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 09:34:13,284 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:34:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:34:13,305 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 09:34:13,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:34:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 27 states and 37 transitions. [2018-11-23 09:34:13,381 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-11-23 09:34:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 09:34:13,384 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:34:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:34:13,420 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 09:34:13,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:34:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 31 states and 44 transitions. [2018-11-23 09:34:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2018-11-23 09:34:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 09:34:13,542 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:34:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:34:13,577 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 09:34:13,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 09:34:13,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 33 states and 50 transitions. [2018-11-23 09:34:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2018-11-23 09:34:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 09:34:13,723 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 09:34:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:34:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:34:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:34:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 09:34:13,770 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 6 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_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0;havoc main_~x~0;havoc main_~y~0;havoc main_~n~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~y~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647] [?] main_#t~short4 := main_~y~0 >= 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short4;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_#t~short4 := 0 != main_#t~nondet3;ParallelCodeBlock1: assume !main_#t~short4;}EndParallelComposition VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647, |ULTIMATE.start_main_#t~nondet3|=0, |ULTIMATE.start_main_#t~short4|=false] [?] assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~nondet3; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647] [?] assume main_~x~0 - 1 <= 2147483647; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647] [?] assume main_~x~0 - 1 >= -2147483648;main_~x~0 := main_~x~0 - 1; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=2147483647] [?] main_#t~short6 := main_~y~0 <= main_~n~0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short6;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;main_#t~short6 := 0 != main_#t~nondet5;ParallelCodeBlock1: assume !main_#t~short6;}EndParallelComposition VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=2147483647, |ULTIMATE.start_main_#t~nondet5|=(- 1), |ULTIMATE.start_main_#t~short6|=true] [?] assume !!main_#t~short6;havoc main_#t~nondet5;havoc main_#t~short6; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=2147483647] [?] assume !(1 + main_~y~0 <= 2147483647); VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0; [L14] havoc main_~x~0; [L14] havoc main_~y~0; [L14] havoc main_~n~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~n~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~x~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~y~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L18-L26] assume !!(main_~x~0 >= 0); VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19] main_#t~short4 := main_~y~0 >= 0; [L19] assume main_#t~short4; [L19] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L19] main_#t~short4 := 0 != main_#t~nondet3; VAL [main_#t~nondet3=0, main_#t~short4=false, main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19-L21] assume !main_#t~short4; [L19] havoc main_#t~short4; [L19] havoc main_#t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 >= -2147483648; [L22] main_~x~0 := main_~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23] main_#t~short6 := main_~y~0 <= main_~n~0; [L23] assume main_#t~short6; [L23] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; [L23] main_#t~short6 := 0 != main_#t~nondet5; VAL [main_#t~nondet5=-1, main_#t~short6=true, main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23-L25] assume !!main_#t~short6; [L23] havoc main_#t~nondet5; [L23] havoc main_#t~short6; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L24] assert 1 + main_~y~0 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0; [L14] havoc main_~x~0; [L14] havoc main_~y~0; [L14] havoc main_~n~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~n~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~x~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~y~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L18-L26] assume !!(main_~x~0 >= 0); VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19] main_#t~short4 := main_~y~0 >= 0; [L19] assume main_#t~short4; [L19] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L19] main_#t~short4 := 0 != main_#t~nondet3; VAL [main_#t~nondet3=0, main_#t~short4=false, main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19-L21] assume !main_#t~short4; [L19] havoc main_#t~short4; [L19] havoc main_#t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 >= -2147483648; [L22] main_~x~0 := main_~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23] main_#t~short6 := main_~y~0 <= main_~n~0; [L23] assume main_#t~short6; [L23] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; [L23] main_#t~short6 := 0 != main_#t~nondet5; VAL [main_#t~nondet5=-1, main_#t~short6=true, main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23-L25] assume !!main_#t~short6; [L23] havoc main_#t~nondet5; [L23] havoc main_#t~short6; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L24] assert 1 + main_~y~0 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0; [L14] havoc main_~x~0; [L14] havoc main_~y~0; [L14] havoc main_~n~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~n~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~x~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~y~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L18-L26] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19] main_#t~short4 := main_~y~0 >= 0; [L19] COND TRUE main_#t~short4 [L19] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L19] main_#t~short4 := 0 != main_#t~nondet3; VAL [main_#t~nondet3=0, main_#t~short4=false, main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19-L21] COND TRUE !main_#t~short4 [L19] havoc main_#t~short4; [L19] havoc main_#t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 >= -2147483648; [L22] main_~x~0 := main_~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23] main_#t~short6 := main_~y~0 <= main_~n~0; [L23] COND TRUE main_#t~short6 [L23] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; [L23] main_#t~short6 := 0 != main_#t~nondet5; VAL [main_#t~nondet5=-1, main_#t~short6=true, main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23-L25] COND FALSE !(!main_#t~short6) [L23] havoc main_#t~nondet5; [L23] havoc main_#t~short6; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L24] assert 1 + main_~y~0 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0; [L14] havoc main_~x~0; [L14] havoc main_~y~0; [L14] havoc main_~n~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~n~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~x~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~y~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L18-L26] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19] main_#t~short4 := main_~y~0 >= 0; [L19] COND TRUE main_#t~short4 [L19] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L19] main_#t~short4 := 0 != main_#t~nondet3; VAL [main_#t~nondet3=0, main_#t~short4=false, main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19-L21] COND TRUE !main_#t~short4 [L19] havoc main_#t~short4; [L19] havoc main_#t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 >= -2147483648; [L22] main_~x~0 := main_~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23] main_#t~short6 := main_~y~0 <= main_~n~0; [L23] COND TRUE main_#t~short6 [L23] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; [L23] main_#t~short6 := 0 != main_#t~nondet5; VAL [main_#t~nondet5=-1, main_#t~short6=true, main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23-L25] COND FALSE !(!main_#t~short6) [L23] havoc main_#t~nondet5; [L23] havoc main_#t~short6; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L24] assert 1 + main_~y~0 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18-L26] COND FALSE !(!(~x~0 >= 0)) [L19] #t~short4 := ~y~0 >= 0; [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~short4; [L19] havoc #t~nondet3; [L22] assert ~x~0 - 1 <= 2147483647; [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; [L23] #t~short6 := ~y~0 <= ~n~0; [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; [L24] assert 1 + ~y~0 <= 2147483647; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18-L26] COND FALSE !(!(~x~0 >= 0)) [L19] #t~short4 := ~y~0 >= 0; [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~short4; [L19] havoc #t~nondet3; [L22] assert ~x~0 - 1 <= 2147483647; [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; [L23] #t~short6 := ~y~0 <= ~n~0; [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; [L24] assert 1 + ~y~0 <= 2147483647; [L14] int x, y, n; [L15] n = __VERIFIER_nondet_int() [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] COND TRUE x >= 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] COND FALSE !(y >= 0 && __VERIFIER_nondet_int() != 0) [L22] EXPR x - 1 [L22] x = x - 1 [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] COND TRUE y <= n && __VERIFIER_nondet_int() != 0 [L24] y + 1 ----- [2018-11-23 09:34:13,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 09:34:13 ImpRootNode [2018-11-23 09:34:13,811 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 09:34:13,812 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 09:34:13,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 09:34:13,812 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 09:34:13,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:34:13" (3/4) ... [2018-11-23 09:34:13,814 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_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0;havoc main_~x~0;havoc main_~y~0;havoc main_~n~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~x~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~y~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647] [?] assume !!(main_~x~0 >= 0); VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647] [?] main_#t~short4 := main_~y~0 >= 0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short4;assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_#t~short4 := 0 != main_#t~nondet3;ParallelCodeBlock1: assume !main_#t~short4;}EndParallelComposition VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647, |ULTIMATE.start_main_#t~nondet3|=0, |ULTIMATE.start_main_#t~short4|=false] [?] assume !main_#t~short4;havoc main_#t~short4;havoc main_#t~nondet3; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647] [?] assume main_~x~0 - 1 <= 2147483647; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=0, ULTIMATE.start_main_~y~0=2147483647] [?] assume main_~x~0 - 1 >= -2147483648;main_~x~0 := main_~x~0 - 1; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=2147483647] [?] main_#t~short6 := main_~y~0 <= main_~n~0;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short6;assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647;main_#t~short6 := 0 != main_#t~nondet5;ParallelCodeBlock1: assume !main_#t~short6;}EndParallelComposition VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=2147483647, |ULTIMATE.start_main_#t~nondet5|=(- 1), |ULTIMATE.start_main_#t~short6|=true] [?] assume !!main_#t~short6;havoc main_#t~nondet5;havoc main_#t~short6; VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=2147483647] [?] assume !(1 + main_~y~0 <= 2147483647); VAL [ULTIMATE.start_main_~n~0=2147483647, ULTIMATE.start_main_~x~0=(- 1), ULTIMATE.start_main_~y~0=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0; [L14] havoc main_~x~0; [L14] havoc main_~y~0; [L14] havoc main_~n~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~n~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~x~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~y~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L18-L26] assume !!(main_~x~0 >= 0); VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19] main_#t~short4 := main_~y~0 >= 0; [L19] assume main_#t~short4; [L19] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L19] main_#t~short4 := 0 != main_#t~nondet3; VAL [main_#t~nondet3=0, main_#t~short4=false, main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19-L21] assume !main_#t~short4; [L19] havoc main_#t~short4; [L19] havoc main_#t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 >= -2147483648; [L22] main_~x~0 := main_~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23] main_#t~short6 := main_~y~0 <= main_~n~0; [L23] assume main_#t~short6; [L23] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; [L23] main_#t~short6 := 0 != main_#t~nondet5; VAL [main_#t~nondet5=-1, main_#t~short6=true, main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23-L25] assume !!main_#t~short6; [L23] havoc main_#t~nondet5; [L23] havoc main_#t~short6; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L24] assert 1 + main_~y~0 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0; [L14] havoc main_~x~0; [L14] havoc main_~y~0; [L14] havoc main_~n~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~n~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~x~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~y~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L18-L26] assume !!(main_~x~0 >= 0); VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19] main_#t~short4 := main_~y~0 >= 0; [L19] assume main_#t~short4; [L19] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L19] main_#t~short4 := 0 != main_#t~nondet3; VAL [main_#t~nondet3=0, main_#t~short4=false, main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19-L21] assume !main_#t~short4; [L19] havoc main_#t~short4; [L19] havoc main_#t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 >= -2147483648; [L22] main_~x~0 := main_~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23] main_#t~short6 := main_~y~0 <= main_~n~0; [L23] assume main_#t~short6; [L23] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; [L23] main_#t~short6 := 0 != main_#t~nondet5; VAL [main_#t~nondet5=-1, main_#t~short6=true, main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23-L25] assume !!main_#t~short6; [L23] havoc main_#t~nondet5; [L23] havoc main_#t~short6; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L24] assert 1 + main_~y~0 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0; [L14] havoc main_~x~0; [L14] havoc main_~y~0; [L14] havoc main_~n~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~n~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~x~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~y~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L18-L26] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19] main_#t~short4 := main_~y~0 >= 0; [L19] COND TRUE main_#t~short4 [L19] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L19] main_#t~short4 := 0 != main_#t~nondet3; VAL [main_#t~nondet3=0, main_#t~short4=false, main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19-L21] COND TRUE !main_#t~short4 [L19] havoc main_#t~short4; [L19] havoc main_#t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 >= -2147483648; [L22] main_~x~0 := main_~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23] main_#t~short6 := main_~y~0 <= main_~n~0; [L23] COND TRUE main_#t~short6 [L23] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; [L23] main_#t~short6 := 0 != main_#t~nondet5; VAL [main_#t~nondet5=-1, main_#t~short6=true, main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23-L25] COND FALSE !(!main_#t~short6) [L23] havoc main_#t~nondet5; [L23] havoc main_#t~short6; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L24] assert 1 + main_~y~0 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~short4, main_#t~nondet5, main_#t~short6, main_~x~0, main_~y~0, main_~n~0; [L14] havoc main_~x~0; [L14] havoc main_~y~0; [L14] havoc main_~n~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~n~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~x~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~y~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L18-L26] COND FALSE !(!(main_~x~0 >= 0)) VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19] main_#t~short4 := main_~y~0 >= 0; [L19] COND TRUE main_#t~short4 [L19] assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647; [L19] main_#t~short4 := 0 != main_#t~nondet3; VAL [main_#t~nondet3=0, main_#t~short4=false, main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L19-L21] COND TRUE !main_#t~short4 [L19] havoc main_#t~short4; [L19] havoc main_#t~nondet3; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=0, main_~y~0=2147483647] [L22] assert main_~x~0 - 1 >= -2147483648; [L22] main_~x~0 := main_~x~0 - 1; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23] main_#t~short6 := main_~y~0 <= main_~n~0; [L23] COND TRUE main_#t~short6 [L23] assume -2147483648 <= main_#t~nondet5 && main_#t~nondet5 <= 2147483647; [L23] main_#t~short6 := 0 != main_#t~nondet5; VAL [main_#t~nondet5=-1, main_#t~short6=true, main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L23-L25] COND FALSE !(!main_#t~short6) [L23] havoc main_#t~nondet5; [L23] havoc main_#t~short6; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L24] assert 1 + main_~y~0 <= 2147483647; VAL [main_~n~0=2147483647, main_~x~0=-1, main_~y~0=2147483647] [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18-L26] COND FALSE !(!(~x~0 >= 0)) [L19] #t~short4 := ~y~0 >= 0; [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~short4; [L19] havoc #t~nondet3; [L22] assert ~x~0 - 1 <= 2147483647; [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; [L23] #t~short6 := ~y~0 <= ~n~0; [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; [L24] assert 1 + ~y~0 <= 2147483647; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] havoc ~x~0; [L14] havoc ~y~0; [L14] havoc ~n~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~n~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~x~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~y~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18-L26] COND FALSE !(!(~x~0 >= 0)) [L19] #t~short4 := ~y~0 >= 0; [L19] COND TRUE #t~short4 [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] #t~short4 := 0 != #t~nondet3; [L19-L21] COND TRUE !#t~short4 [L19] havoc #t~short4; [L19] havoc #t~nondet3; [L22] assert ~x~0 - 1 <= 2147483647; [L22] assert ~x~0 - 1 >= -2147483648; [L22] ~x~0 := ~x~0 - 1; [L23] #t~short6 := ~y~0 <= ~n~0; [L23] COND TRUE #t~short6 [L23] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L23] #t~short6 := 0 != #t~nondet5; [L23-L25] COND FALSE !(!#t~short6) [L23] havoc #t~nondet5; [L23] havoc #t~short6; [L24] assert 1 + ~y~0 <= 2147483647; [L14] int x, y, n; [L15] n = __VERIFIER_nondet_int() [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] COND TRUE x >= 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] COND FALSE !(y >= 0 && __VERIFIER_nondet_int() != 0) [L22] EXPR x - 1 [L22] x = x - 1 [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] COND TRUE y <= n && __VERIFIER_nondet_int() != 0 [L24] y + 1 ----- [2018-11-23 09:34:13,857 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a88998ed-e0a9-415a-a230-ae61784b49a8/bin-2019/ukojak/witness.graphml [2018-11-23 09:34:13,857 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 09:34:13,857 INFO L168 Benchmark]: Toolchain (without parser) took 1223.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -78.1 MB). Peak memory consumption was 68.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:34:13,859 INFO L168 Benchmark]: CDTParser took 0.10 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-23 09:34:13,859 INFO L168 Benchmark]: CACSL2BoogieTranslator took 142.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:34:13,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.32 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:34:13,860 INFO L168 Benchmark]: Boogie Preprocessor took 13.62 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 09:34:13,860 INFO L168 Benchmark]: RCFGBuilder took 246.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:34:13,861 INFO L168 Benchmark]: CodeCheck took 751.69 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: 89.8 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. [2018-11-23 09:34:13,861 INFO L168 Benchmark]: Witness Printer took 45.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 09:34:13,863 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, 24 locations, 6 error locations. UNSAFE Result, 0.6s OverallTime, 6 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 256 SDtfs, 178 SDslu, 232 SDs, 0 SdLazy, 370 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 220 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 240 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: 24]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x, y, n; [L15] n = __VERIFIER_nondet_int() [L16] x = __VERIFIER_nondet_int() [L17] y = __VERIFIER_nondet_int() [L18] COND TRUE x >= 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] y >= 0 && __VERIFIER_nondet_int() != 0 [L19] COND FALSE !(y >= 0 && __VERIFIER_nondet_int() != 0) [L22] EXPR x - 1 [L22] x = x - 1 [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] y <= n && __VERIFIER_nondet_int() != 0 [L23] COND TRUE y <= n && __VERIFIER_nondet_int() != 0 [L24] y + 1 * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 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 142.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 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 21.32 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.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 13.62 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 246.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * CodeCheck took 751.69 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: 89.8 MB). Peak memory consumption was 89.8 MB. Max. memory is 11.5 GB. * Witness Printer took 45.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...