./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/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 59acfc6d5178664a3f2144603274c2b6e876292a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.25-f470102 [2019-12-02 02:18:26,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-02 02:18:26,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-02 02:18:26,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-02 02:18:26,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-02 02:18:26,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-02 02:18:26,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-02 02:18:26,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-02 02:18:26,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-02 02:18:26,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-02 02:18:26,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-02 02:18:26,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-02 02:18:26,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-02 02:18:26,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-02 02:18:26,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-02 02:18:26,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-02 02:18:26,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-02 02:18:26,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-02 02:18:26,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-02 02:18:26,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-02 02:18:26,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-02 02:18:26,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-02 02:18:26,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-02 02:18:26,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-02 02:18:26,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-02 02:18:26,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-02 02:18:26,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-02 02:18:26,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-02 02:18:26,781 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-02 02:18:26,782 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-02 02:18:26,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-02 02:18:26,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-02 02:18:26,783 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-02 02:18:26,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-02 02:18:26,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-02 02:18:26,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-02 02:18:26,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-02 02:18:26,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-02 02:18:26,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-02 02:18:26,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-02 02:18:26,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-02 02:18:26,786 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2019-12-02 02:18:26,796 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-02 02:18:26,796 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-02 02:18:26,796 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-02 02:18:26,796 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-02 02:18:26,797 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-02 02:18:26,797 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-02 02:18:26,797 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-02 02:18:26,797 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-02 02:18:26,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-02 02:18:26,798 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-02 02:18:26,798 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-02 02:18:26,798 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-02 02:18:26,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-02 02:18:26,798 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-02 02:18:26,798 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-02 02:18:26,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-02 02:18:26,798 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-02 02:18:26,799 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-02 02:18:26,799 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-02 02:18:26,799 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-02 02:18:26,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-02 02:18:26,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-02 02:18:26,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-02 02:18:26,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-02 02:18:26,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-02 02:18:26,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-02 02:18:26,800 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-02 02:18:26,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-02 02:18:26,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-02 02:18:26,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/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 -> 59acfc6d5178664a3f2144603274c2b6e876292a [2019-12-02 02:18:26,897 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-02 02:18:26,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-02 02:18:26,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-02 02:18:26,911 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-02 02:18:26,912 INFO L275 PluginConnector]: CDTParser initialized [2019-12-02 02:18:26,912 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/../../sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2019-12-02 02:18:26,960 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/data/551819d7d/2586d737b9a341c89d1d1af8f5e78db1/FLAG3eaf0751c [2019-12-02 02:18:27,382 INFO L306 CDTParser]: Found 1 translation units. [2019-12-02 02:18:27,383 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/sv-benchmarks/c/recursive-simple/sum_25x0-2.c [2019-12-02 02:18:27,386 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/data/551819d7d/2586d737b9a341c89d1d1af8f5e78db1/FLAG3eaf0751c [2019-12-02 02:18:27,395 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/data/551819d7d/2586d737b9a341c89d1d1af8f5e78db1 [2019-12-02 02:18:27,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-02 02:18:27,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-02 02:18:27,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-02 02:18:27,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-02 02:18:27,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-02 02:18:27,401 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548029d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27, skipping insertion in model container [2019-12-02 02:18:27,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-02 02:18:27,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-02 02:18:27,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 02:18:27,514 INFO L203 MainTranslator]: Completed pre-run [2019-12-02 02:18:27,554 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-02 02:18:27,564 INFO L208 MainTranslator]: Completed translation [2019-12-02 02:18:27,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27 WrapperNode [2019-12-02 02:18:27,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-02 02:18:27,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-02 02:18:27,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-02 02:18:27,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-02 02:18:27,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,575 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-02 02:18:27,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-02 02:18:27,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-02 02:18:27,587 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-02 02:18:27,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,596 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-02 02:18:27,597 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-02 02:18:27,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-02 02:18:27,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-02 02:18:27,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:18:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/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 [2019-12-02 02:18:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-02 02:18:27,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-02 02:18:27,638 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-12-02 02:18:27,638 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-12-02 02:18:27,735 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-02 02:18:27,735 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-02 02:18:27,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:27 BoogieIcfgContainer [2019-12-02 02:18:27,736 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-02 02:18:27,736 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-02 02:18:27,736 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-02 02:18:27,743 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-02 02:18:27,743 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:27" (1/1) ... [2019-12-02 02:18:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-02 02:18:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 14 states and 16 transitions. [2019-12-02 02:18:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-12-02 02:18:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-02 02:18:27,778 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-02 02:18:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 18 states and 22 transitions. [2019-12-02 02:18:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2019-12-02 02:18:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-02 02:18:28,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-02 02:18:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 23 states and 32 transitions. [2019-12-02 02:18:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2019-12-02 02:18:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-02 02:18:28,348 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-02 02:18:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 28 states and 44 transitions. [2019-12-02 02:18:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 44 transitions. [2019-12-02 02:18:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-02 02:18:28,770 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-02 02:18:29,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 33 states and 58 transitions. [2019-12-02 02:18:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 58 transitions. [2019-12-02 02:18:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-02 02:18:29,303 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-02 02:18:29,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 38 states and 74 transitions. [2019-12-02 02:18:29,880 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 74 transitions. [2019-12-02 02:18:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-02 02:18:29,881 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-02 02:18:30,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:30,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 43 states and 92 transitions. [2019-12-02 02:18:30,603 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 92 transitions. [2019-12-02 02:18:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-02 02:18:30,605 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:30,868 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-12-02 02:18:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 48 states and 112 transitions. [2019-12-02 02:18:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 112 transitions. [2019-12-02 02:18:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-02 02:18:31,437 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-12-02 02:18:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 53 states and 134 transitions. [2019-12-02 02:18:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 134 transitions. [2019-12-02 02:18:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-02 02:18:32,317 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-12-02 02:18:33,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:33,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 58 states and 158 transitions. [2019-12-02 02:18:33,278 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 158 transitions. [2019-12-02 02:18:33,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-02 02:18:33,279 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-12-02 02:18:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:35,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 63 states and 184 transitions. [2019-12-02 02:18:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 184 transitions. [2019-12-02 02:18:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-02 02:18:35,109 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:35,441 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-02 02:18:36,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 68 states and 212 transitions. [2019-12-02 02:18:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 212 transitions. [2019-12-02 02:18:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-02 02:18:36,319 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-12-02 02:18:37,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:37,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 73 states and 242 transitions. [2019-12-02 02:18:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 242 transitions. [2019-12-02 02:18:37,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-02 02:18:37,662 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:38,107 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-12-02 02:18:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 78 states and 274 transitions. [2019-12-02 02:18:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 274 transitions. [2019-12-02 02:18:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-02 02:18:39,057 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-12-02 02:18:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 83 states and 308 transitions. [2019-12-02 02:18:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 308 transitions. [2019-12-02 02:18:40,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-02 02:18:40,790 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-12-02 02:18:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 88 states and 344 transitions. [2019-12-02 02:18:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 344 transitions. [2019-12-02 02:18:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-02 02:18:42,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-12-02 02:18:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:46,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 93 states and 382 transitions. [2019-12-02 02:18:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 382 transitions. [2019-12-02 02:18:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-02 02:18:46,296 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-12-02 02:18:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 98 states and 422 transitions. [2019-12-02 02:18:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 422 transitions. [2019-12-02 02:18:48,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-02 02:18:48,433 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:49,289 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-12-02 02:18:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 103 states and 464 transitions. [2019-12-02 02:18:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 464 transitions. [2019-12-02 02:18:50,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-02 02:18:50,681 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:51,570 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-12-02 02:18:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 108 states and 508 transitions. [2019-12-02 02:18:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 508 transitions. [2019-12-02 02:18:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-02 02:18:53,055 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-12-02 02:18:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 113 states and 554 transitions. [2019-12-02 02:18:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 554 transitions. [2019-12-02 02:18:55,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-12-02 02:18:55,487 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:18:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-12-02 02:18:58,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:18:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 118 states and 602 transitions. [2019-12-02 02:18:58,752 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 602 transitions. [2019-12-02 02:18:58,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-02 02:18:58,754 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:18:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:19:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-12-02 02:19:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:19:01,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 123 states and 652 transitions. [2019-12-02 02:19:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-12-02 02:19:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-02 02:19:01,670 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:19:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:19:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-12-02 02:19:04,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:19:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 128 states and 704 transitions. [2019-12-02 02:19:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 704 transitions. [2019-12-02 02:19:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-02 02:19:04,577 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:19:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:19:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-12-02 02:19:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:19:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 133 states and 758 transitions. [2019-12-02 02:19:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 758 transitions. [2019-12-02 02:19:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-02 02:19:07,766 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:19:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-02 02:19:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-12-02 02:19:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-02 02:19:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 138 states and 814 transitions. [2019-12-02 02:19:10,732 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 814 transitions. [2019-12-02 02:19:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-02 02:19:10,733 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-02 02:19:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 02:19:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 02:19:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 02:19:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-02 02:19:10,930 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 26 iterations. [2019-12-02 02:19:10,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 02.12 02:19:10 ImpRootNode [2019-12-02 02:19:10,979 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-02 02:19:10,979 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-02 02:19:10,979 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-02 02:19:10,979 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-02 02:19:10,980 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:18:27" (3/4) ... [2019-12-02 02:19:10,981 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-02 02:19:11,043 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dc06096a-873a-4e4c-bb95-88caccb89723/bin/ukojak/witness.graphml [2019-12-02 02:19:11,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-02 02:19:11,045 INFO L168 Benchmark]: Toolchain (without parser) took 43646.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 367.5 MB). Free memory was 943.6 MB in the beginning and 858.3 MB in the end (delta: 85.3 MB). Peak memory consumption was 452.8 MB. Max. memory is 11.5 GB. [2019-12-02 02:19:11,045 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 02:19:11,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-12-02 02:19:11,046 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 02:19:11,046 INFO L168 Benchmark]: Boogie Preprocessor took 10.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-02 02:19:11,046 INFO L168 Benchmark]: RCFGBuilder took 138.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-12-02 02:19:11,046 INFO L168 Benchmark]: CodeCheck took 43242.51 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 1.1 GB in the beginning and 861.9 MB in the end (delta: 221.7 MB). Peak memory consumption was 483.9 MB. Max. memory is 11.5 GB. [2019-12-02 02:19:11,047 INFO L168 Benchmark]: Witness Printer took 64.24 ms. Allocated memory is still 1.4 GB. Free memory was 861.9 MB in the beginning and 858.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2019-12-02 02:19:11,048 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Result: UNSAFE, OverallTime: 43.1s, OverallIterations: 26, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 184549376 SDtfs, 134217724 SDslu, 167772152 SDs, 0 SdLazy, -2130706908 SolverSat, 486539244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54803 GetRequests, 52754 SyntacticMatches, 1657 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92050 ImplicationChecksByTransitivity, 37.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 2184 NumberOfCodeBlocks, 2184 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2000 ConstructedInterpolants, 0 QuantifiedInterpolants, 1216800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 7500/15000 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 25; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=25] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=25, m=0, n=25] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=24, m=1, n=24] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=23, m=2, n=23] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=22, m=3, n=22] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=21, m=4, n=21] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=20, m=5, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=19, m=6, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=18, m=7, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=17, m=8, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=16, m=9, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=15, m=10, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=14, m=11, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=13, m=12, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=12, m=13, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=11, m=14, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=10, m=15, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=9, m=16, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=8, m=17, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=7, m=18, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=6, m=19, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=20, \old(n)=5, m=20, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=21, \old(n)=4, m=21, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=22, \old(n)=3, m=22, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=23, \old(n)=2, m=23, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=24, \old(n)=1, m=24, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=25, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=25, \old(n)=0, \result=25, m=25, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=24, \old(n)=1, m=24, n=1, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=23, \old(n)=2, m=23, n=2, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=22, \old(n)=3, m=22, n=3, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=21, \old(n)=4, m=21, n=4, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=5, m=20, n=5, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=6, m=19, n=6, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=7, m=18, n=7, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=8, m=17, n=8, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=9, m=16, n=9, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=10, m=15, n=10, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=11, m=14, n=11, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=12, m=13, n=12, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=13, m=12, n=13, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=14, m=11, n=14, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=15, m=10, n=15, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=16, m=9, n=16, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=17, m=8, n=17, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=18, m=7, n=18, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=19, m=6, n=19, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=20, m=5, n=20, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=21, m=4, n=21, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=22, m=3, n=22, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=23, m=2, n=23, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=24, m=1, n=24, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=25, m=0, n=25, sum(n - 1, m + 1)=25] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.86 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -156.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 21.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.29 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 138.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * CodeCheck took 43242.51 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 262.1 MB). Free memory was 1.1 GB in the beginning and 861.9 MB in the end (delta: 221.7 MB). Peak memory consumption was 483.9 MB. Max. memory is 11.5 GB. * Witness Printer took 64.24 ms. Allocated memory is still 1.4 GB. Free memory was 861.9 MB in the beginning and 858.3 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...