./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b149b3cef099476d14a8b122afb66552d0406eb ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:18:04,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:18:04,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:18:04,075 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:18:04,075 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:18:04,076 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:18:04,076 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:18:04,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:18:04,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:18:04,079 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:18:04,079 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:18:04,080 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:18:04,080 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:18:04,081 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:18:04,082 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:18:04,082 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:18:04,083 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:18:04,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:18:04,085 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:18:04,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:18:04,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:18:04,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:18:04,089 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:18:04,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:18:04,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:18:04,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:18:04,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:18:04,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:18:04,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:18:04,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:18:04,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:18:04,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:18:04,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:18:04,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:18:04,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:18:04,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:18:04,095 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-22 22:18:04,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:18:04,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:18:04,106 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:18:04,106 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-22 22:18:04,106 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:18:04,106 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:18:04,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:18:04,107 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:18:04,107 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:18:04,107 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:18:04,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:18:04,107 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:18:04,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:18:04,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:18:04,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:18:04,107 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:18:04,108 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:18:04,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:18:04,108 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-22 22:18:04,108 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-22 22:18:04,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:18:04,108 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:18:04,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-22 22:18:04,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:18:04,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:18:04,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:18:04,109 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-22 22:18:04,109 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:18:04,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:18:04,109 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_92133c11-90cc-48d7-942b-0cf9263b0cee/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 ! call(__VERIFIER_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b149b3cef099476d14a8b122afb66552d0406eb [2018-11-22 22:18:04,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:18:04,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:18:04,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:18:04,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:18:04,146 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:18:04,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/../../sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-22 22:18:04,186 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/data/4f2d2cafb/0f297ce1bca3465f9cfed3a84217df84/FLAG2d9872c39 [2018-11-22 22:18:04,580 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:18:04,580 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/sv-benchmarks/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-22 22:18:04,584 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/data/4f2d2cafb/0f297ce1bca3465f9cfed3a84217df84/FLAG2d9872c39 [2018-11-22 22:18:04,595 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/data/4f2d2cafb/0f297ce1bca3465f9cfed3a84217df84 [2018-11-22 22:18:04,597 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:18:04,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:18:04,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:18:04,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:18:04,601 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:18:04,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@108971e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04, skipping insertion in model container [2018-11-22 22:18:04,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,609 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:18:04,621 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:18:04,720 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:18:04,723 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:18:04,734 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:18:04,742 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:18:04,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04 WrapperNode [2018-11-22 22:18:04,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:18:04,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:18:04,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:18:04,743 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:18:04,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:18:04,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:18:04,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:18:04,761 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:18:04,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:18:04,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:18:04,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:18:04,772 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:18:04,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:18:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/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-22 22:18:04,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:18:04,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:18:04,962 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:18:04,962 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-22 22:18:04,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:18:04 BoogieIcfgContainer [2018-11-22 22:18:04,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:18:04,963 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-22 22:18:04,963 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-22 22:18:04,970 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-22 22:18:04,970 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:18:04" (1/1) ... [2018-11-22 22:18:04,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:18:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 22:18:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 7 states and 8 transitions. [2018-11-22 22:18:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-11-22 22:18:05,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-22 22:18:05,009 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 22:18:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:18:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:18:05,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 22:18:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 9 states and 12 transitions. [2018-11-22 22:18:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2018-11-22 22:18:05,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-22 22:18:05,157 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 22:18:05,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:18:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:18:05,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 22:18:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 11 states and 19 transitions. [2018-11-22 22:18:05,458 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-11-22 22:18:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-22 22:18:05,459 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 22:18:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:18:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:18:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 22:18:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 12 states and 22 transitions. [2018-11-22 22:18:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 22 transitions. [2018-11-22 22:18:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-22 22:18:05,657 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 22:18:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:18:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:18:05,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-22 22:18:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 13 states and 24 transitions. [2018-11-22 22:18:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2018-11-22 22:18:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-22 22:18:05,874 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-22 22:18:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:18:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:18:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:18:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:18:05,925 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~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=0] [?] assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0;BeginParallelComposition{ParallelCodeBlock0: assume 4 == main_~i~0;main_~sn~0 := -10;ParallelCodeBlock1: assume !(4 == main_~i~0);}EndParallelCompositionmain_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=2] [?] assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0;BeginParallelComposition{ParallelCodeBlock0: assume 4 == main_~i~0;main_~sn~0 := -10;ParallelCodeBlock1: assume !(4 == main_~i~0);}EndParallelCompositionmain_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=4] [?] assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0;BeginParallelComposition{ParallelCodeBlock0: assume 4 == main_~i~0;main_~sn~0 := -10;ParallelCodeBlock1: assume !(4 == main_~i~0);}EndParallelCompositionmain_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0;BeginParallelComposition{ParallelCodeBlock0: assume 4 == main_~i~0;main_~sn~0 := -10;ParallelCodeBlock1: assume !(4 == main_~i~0);}EndParallelCompositionmain_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=(- 10)] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 <= main_~n~0);}EndParallelComposition__VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=(- 10), |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=(- 10), |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=(- 10), |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc main_#t~nondet0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume 4 == main_~i~0; [L15] main_~sn~0 := -10; [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L13-L16] assume !(main_~i~0 <= main_~n~0); [L17] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc main_#t~nondet0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume 4 == main_~i~0; [L15] main_~sn~0 := -10; [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L13-L16] assume !(main_~i~0 <= main_~n~0); [L17] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc main_#t~nondet0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND TRUE 4 == main_~i~0 [L15] main_~sn~0 := -10; [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L13-L16] COND TRUE !(main_~i~0 <= main_~n~0) [L17] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc main_#t~nondet0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND TRUE 4 == main_~i~0 [L15] main_~sn~0 := -10; [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L13-L16] COND TRUE !(main_~i~0 <= main_~n~0) [L17] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND TRUE !(~i~0 <= ~n~0) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND TRUE !(~i~0 <= ~n~0) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND TRUE i==4 [L15] sn=-10 [L13] i++ [L13] COND FALSE !(i<=n) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() ----- [2018-11-22 22:18:05,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 22.11 10:18:05 ImpRootNode [2018-11-22 22:18:05,953 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-22 22:18:05,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:18:05,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:18:05,953 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:18:05,954 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:18:04" (3/4) ... [2018-11-22 22:18:05,956 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~post1, main_~i~0, main_~n~0, main_~sn~0;havoc main_~i~0;main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc main_#t~nondet0;main_~sn~0 := 0;main_~i~0 := 1; VAL [ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=0] [?] assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0;BeginParallelComposition{ParallelCodeBlock0: assume 4 == main_~i~0;main_~sn~0 := -10;ParallelCodeBlock1: assume !(4 == main_~i~0);}EndParallelCompositionmain_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~i~0=2, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=2] [?] assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0;BeginParallelComposition{ParallelCodeBlock0: assume 4 == main_~i~0;main_~sn~0 := -10;ParallelCodeBlock1: assume !(4 == main_~i~0);}EndParallelCompositionmain_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~i~0=3, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=4] [?] assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0;BeginParallelComposition{ParallelCodeBlock0: assume 4 == main_~i~0;main_~sn~0 := -10;ParallelCodeBlock1: assume !(4 == main_~i~0);}EndParallelCompositionmain_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~i~0=4, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=6] [?] assume !!(main_~i~0 <= main_~n~0);main_~sn~0 := 2 + main_~sn~0;BeginParallelComposition{ParallelCodeBlock0: assume 4 == main_~i~0;main_~sn~0 := -10;ParallelCodeBlock1: assume !(4 == main_~i~0);}EndParallelCompositionmain_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; VAL [ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=(- 10)] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 <= main_~n~0);}EndParallelComposition__VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=(- 10), |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=(- 10), |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=5, ULTIMATE.start_main_~n~0=4, ULTIMATE.start_main_~sn~0=(- 10), |ULTIMATE.start___VERIFIER_assert_#in~cond|=0] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc main_#t~nondet0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume 4 == main_~i~0; [L15] main_~sn~0 := -10; [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L13-L16] assume !(main_~i~0 <= main_~n~0); [L17] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc main_#t~nondet0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume !(4 == main_~i~0); [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [L13-L16] assume !!(main_~i~0 <= main_~n~0); [L14] main_~sn~0 := 2 + main_~sn~0; [L15] assume 4 == main_~i~0; [L15] main_~sn~0 := -10; [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L13-L16] assume !(main_~i~0 <= main_~n~0); [L17] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L4-L6] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc main_#t~nondet0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND TRUE 4 == main_~i~0 [L15] main_~sn~0 := -10; [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L13-L16] COND TRUE !(main_~i~0 <= main_~n~0) [L17] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~i~0, main_~n~0, main_~sn~0; [L12] havoc main_~i~0; [L12] main_~n~0 := (if main_#t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then main_#t~nondet0 % 4294967296 % 4294967296 else main_#t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc main_#t~nondet0; [L12] main_~sn~0 := 0; [L13] main_~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND FALSE !(4 == main_~i~0) [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [L13-L16] COND FALSE !(!(main_~i~0 <= main_~n~0)) [L14] main_~sn~0 := 2 + main_~sn~0; [L15] COND TRUE 4 == main_~i~0 [L15] main_~sn~0 := -10; [L13] main_#t~post1 := main_~i~0; [L13] main_~i~0 := 1 + main_#t~post1; [L13] havoc main_#t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L13-L16] COND TRUE !(main_~i~0 <= main_~n~0) [L17] __VERIFIER_assert_#in~cond := (if main_~sn~0 == 2 * main_~n~0 || 0 == main_~sn~0 then 1 else 0); [L17] havoc __VERIFIER_assert_~cond; [L3-L8] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L4] COND TRUE 0 == __VERIFIER_assert_~cond VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L5] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~i~0=5, main_~n~0=4, main_~sn~0=-10] [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND TRUE !(~i~0 <= ~n~0) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND FALSE !(4 == ~i~0) [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; [L13-L16] COND TRUE !(~i~0 <= ~n~0) [L3-L8] ~cond := #in~cond; [L4] COND TRUE 0 == ~cond [L5] assert false; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND TRUE i==4 [L15] sn=-10 [L13] i++ [L13] COND FALSE !(i<=n) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() ----- [2018-11-22 22:18:06,003 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_92133c11-90cc-48d7-942b-0cf9263b0cee/bin-2019/ukojak/witness.graphml [2018-11-22 22:18:06,003 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:18:06,004 INFO L168 Benchmark]: Toolchain (without parser) took 1406.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 959.2 MB in the beginning and 968.9 MB in the end (delta: -9.6 MB). Peak memory consumption was 126.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:18:06,006 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:18:06,006 INFO L168 Benchmark]: CACSL2BoogieTranslator took 143.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-22 22:18:06,007 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.54 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:18:06,008 INFO L168 Benchmark]: Boogie Preprocessor took 10.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:18:06,008 INFO L168 Benchmark]: RCFGBuilder took 190.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:18:06,009 INFO L168 Benchmark]: CodeCheck took 990.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.6 MB in the end (delta: 149.9 MB). Peak memory consumption was 149.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:18:06,010 INFO L168 Benchmark]: Witness Printer took 50.31 ms. Allocated memory is still 1.2 GB. Free memory was 971.6 MB in the beginning and 968.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:18:06,015 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, 11 locations, 1 error locations. UNSAFE Result, 0.9s OverallTime, 5 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 296 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 172 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/10 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: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND FALSE !(i==4) [L13] i++ [L13] COND TRUE i<=n [L14] sn = sn + (2) [L15] COND TRUE i==4 [L15] sn=-10 [L13] i++ [L13] COND FALSE !(i<=n) [L4] COND TRUE !(cond) [L5] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 143.87 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.54 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 190.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -175.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * CodeCheck took 990.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.6 MB in the end (delta: 149.9 MB). Peak memory consumption was 149.9 MB. Max. memory is 11.5 GB. * Witness Printer took 50.31 ms. Allocated memory is still 1.2 GB. Free memory was 971.6 MB in the beginning and 968.9 MB 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...