./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-terminate_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-terminate_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 2227825b094336cea9cd81768b48348a309a725b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 05:51:55,060 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:51:55,061 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:51:55,068 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:51:55,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:51:55,069 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:51:55,070 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:51:55,071 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:51:55,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:51:55,073 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:51:55,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:51:55,073 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:51:55,074 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:51:55,075 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:51:55,076 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:51:55,076 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:51:55,077 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:51:55,078 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:51:55,079 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:51:55,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:51:55,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:51:55,081 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:51:55,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:51:55,083 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:51:55,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:51:55,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:51:55,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:51:55,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:51:55,086 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:51:55,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:51:55,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:51:55,088 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:51:55,088 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:51:55,088 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:51:55,089 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:51:55,089 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:51:55,089 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/config/svcomp-Overflow-64bit-Kojak_Default.epf [2018-11-23 05:51:55,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:51:55,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:51:55,101 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 05:51:55,101 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 05:51:55,101 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:51:55,102 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:51:55,102 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:51:55,102 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:51:55,102 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:51:55,102 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:51:55,102 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 05:51:55,102 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:51:55,103 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 05:51:55,103 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 05:51:55,103 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 05:51:55,103 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:51:55,103 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 05:51:55,103 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 05:51:55,103 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 05:51:55,103 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:51:55,104 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:51:55,104 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:51:55,104 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:51:55,104 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:51:55,104 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 05:51:55,104 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 05:51:55,104 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:51:55,105 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 05:51:55,105 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_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2227825b094336cea9cd81768b48348a309a725b [2018-11-23 05:51:55,129 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:51:55,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:51:55,141 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:51:55,142 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:51:55,143 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:51:55,143 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-terminate_false-no-overflow.c [2018-11-23 05:51:55,187 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/data/2f588c222/163b48bc4c684c5d864f0e4e10ed7e55/FLAGfbc7b6ddc [2018-11-23 05:51:55,513 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:51:55,513 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-terminate_false-no-overflow.c [2018-11-23 05:51:55,517 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/data/2f588c222/163b48bc4c684c5d864f0e4e10ed7e55/FLAGfbc7b6ddc [2018-11-23 05:51:55,945 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/data/2f588c222/163b48bc4c684c5d864f0e4e10ed7e55 [2018-11-23 05:51:55,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:51:55,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:51:55,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:51:55,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:51:55,951 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:51:55,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:51:55" (1/1) ... [2018-11-23 05:51:55,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55aa7ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:55, skipping insertion in model container [2018-11-23 05:51:55,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:51:55" (1/1) ... [2018-11-23 05:51:55,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:51:55,970 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:51:56,073 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:51:56,076 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:51:56,085 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:51:56,092 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:51:56,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56 WrapperNode [2018-11-23 05:51:56,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:51:56,093 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:51:56,093 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:51:56,093 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:51:56,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:51:56,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:51:56,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:51:56,112 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:51:56,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:51:56,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:51:56,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:51:56,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:51:56,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:51:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:51:56,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:51:56,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:51:56,294 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:51:56,294 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 05:51:56,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:51:56 BoogieIcfgContainer [2018-11-23 05:51:56,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:51:56,295 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 05:51:56,295 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 05:51:56,302 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 05:51:56,302 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:51:56" (1/1) ... [2018-11-23 05:51:56,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:51:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:51:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-11-23 05:51:56,340 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-11-23 05:51:56,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-11-23 05:51:56,342 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:51:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:51:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:51:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-11-23 05:51:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-11-23 05:51:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 05:51:56,452 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:51:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:51:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:51:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 13 states and 15 transitions. [2018-11-23 05:51:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-11-23 05:51:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 05:51:56,594 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:51:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:51:56,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 05:51:56,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:51:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 17 states and 22 transitions. [2018-11-23 05:51:56,831 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-11-23 05:51:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 05:51:56,834 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:51:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:51:56,867 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 4 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~ell~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=(- 2147483648), ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume !!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0);main_~ell~0 := main_~i~0;main_~i~0 := main_~j~0; VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=(- 2147483648), ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume 1 + main_~ell~0 <= 2147483647; VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=(- 2147483648), ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume 1 + main_~ell~0 >= -2147483648;main_~j~0 := 1 + main_~ell~0; VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume main_~k~0 - 1 <= 2147483647; VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume !(main_~k~0 - 1 >= -2147483648); VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~k~0=(- 2147483648)] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0; [L14] havoc main_~i~0; [L14] havoc main_~j~0; [L14] havoc main_~k~0; [L14] havoc main_~ell~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~i~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~j~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~k~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~i~0=0, main_~j~0=-2147483648, main_~k~0=-2147483648] [L18-L23] assume !!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0); [L19] main_~ell~0 := main_~i~0; [L20] main_~i~0 := main_~j~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 >= -2147483648; [L21] main_~j~0 := 1 + main_~ell~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 >= -2147483648; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0; [L14] havoc main_~i~0; [L14] havoc main_~j~0; [L14] havoc main_~k~0; [L14] havoc main_~ell~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~i~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~j~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~k~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~i~0=0, main_~j~0=-2147483648, main_~k~0=-2147483648] [L18-L23] assume !!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0); [L19] main_~ell~0 := main_~i~0; [L20] main_~i~0 := main_~j~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 >= -2147483648; [L21] main_~j~0 := 1 + main_~ell~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 >= -2147483648; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0; [L14] havoc main_~i~0; [L14] havoc main_~j~0; [L14] havoc main_~k~0; [L14] havoc main_~ell~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~i~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~j~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~k~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~i~0=0, main_~j~0=-2147483648, main_~k~0=-2147483648] [L18-L23] COND FALSE !(!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0)) [L19] main_~ell~0 := main_~i~0; [L20] main_~i~0 := main_~j~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 >= -2147483648; [L21] main_~j~0 := 1 + main_~ell~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 >= -2147483648; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0; [L14] havoc main_~i~0; [L14] havoc main_~j~0; [L14] havoc main_~k~0; [L14] havoc main_~ell~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~i~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~j~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~k~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~i~0=0, main_~j~0=-2147483648, main_~k~0=-2147483648] [L18-L23] COND FALSE !(!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0)) [L19] main_~ell~0 := main_~i~0; [L20] main_~i~0 := main_~j~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 >= -2147483648; [L21] main_~j~0 := 1 + main_~ell~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 >= -2147483648; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; [L21] assert 1 + ~ell~0 <= 2147483647; [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; [L22] assert ~k~0 - 1 <= 2147483647; [L22] assert ~k~0 - 1 >= -2147483648; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; [L21] assert 1 + ~ell~0 <= 2147483647; [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; [L22] assert ~k~0 - 1 <= 2147483647; [L22] assert ~k~0 - 1 >= -2147483648; [L14] int i, j, k, ell; [L15] i = __VERIFIER_nondet_int() [L16] j = __VERIFIER_nondet_int() [L17] k = __VERIFIER_nondet_int() [L18] COND TRUE i <= 100 && j <= k [L19] ell = i [L20] i = j [L21] EXPR ell + 1 [L21] j = ell + 1 [L22] k - 1 ----- [2018-11-23 05:51:56,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 05:51:56 ImpRootNode [2018-11-23 05:51:56,892 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 05:51:56,893 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:51:56,893 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:51:56,893 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:51:56,894 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:51:56" (3/4) ... [2018-11-23 05:51:56,896 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~ell~0;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2; VAL [ULTIMATE.start_main_~i~0=0, ULTIMATE.start_main_~j~0=(- 2147483648), ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume !!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0);main_~ell~0 := main_~i~0;main_~i~0 := main_~j~0; VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=(- 2147483648), ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume 1 + main_~ell~0 <= 2147483647; VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=(- 2147483648), ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume 1 + main_~ell~0 >= -2147483648;main_~j~0 := 1 + main_~ell~0; VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume main_~k~0 - 1 <= 2147483647; VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~k~0=(- 2147483648)] [?] assume !(main_~k~0 - 1 >= -2147483648); VAL [ULTIMATE.start_main_~ell~0=0, ULTIMATE.start_main_~i~0=(- 2147483648), ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~k~0=(- 2147483648)] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0; [L14] havoc main_~i~0; [L14] havoc main_~j~0; [L14] havoc main_~k~0; [L14] havoc main_~ell~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~i~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~j~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~k~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~i~0=0, main_~j~0=-2147483648, main_~k~0=-2147483648] [L18-L23] assume !!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0); [L19] main_~ell~0 := main_~i~0; [L20] main_~i~0 := main_~j~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 >= -2147483648; [L21] main_~j~0 := 1 + main_~ell~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 >= -2147483648; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0; [L14] havoc main_~i~0; [L14] havoc main_~j~0; [L14] havoc main_~k~0; [L14] havoc main_~ell~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~i~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~j~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~k~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~i~0=0, main_~j~0=-2147483648, main_~k~0=-2147483648] [L18-L23] assume !!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0); [L19] main_~ell~0 := main_~i~0; [L20] main_~i~0 := main_~j~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 >= -2147483648; [L21] main_~j~0 := 1 + main_~ell~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 >= -2147483648; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0; [L14] havoc main_~i~0; [L14] havoc main_~j~0; [L14] havoc main_~k~0; [L14] havoc main_~ell~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~i~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~j~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~k~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~i~0=0, main_~j~0=-2147483648, main_~k~0=-2147483648] [L18-L23] COND FALSE !(!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0)) [L19] main_~ell~0 := main_~i~0; [L20] main_~i~0 := main_~j~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 >= -2147483648; [L21] main_~j~0 := 1 + main_~ell~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 >= -2147483648; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~k~0, main_~ell~0; [L14] havoc main_~i~0; [L14] havoc main_~j~0; [L14] havoc main_~k~0; [L14] havoc main_~ell~0; [L15] assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647; [L15] main_~i~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L16] main_~j~0 := main_#t~nondet1; [L16] havoc main_#t~nondet1; [L17] assume -2147483648 <= main_#t~nondet2 && main_#t~nondet2 <= 2147483647; [L17] main_~k~0 := main_#t~nondet2; [L17] havoc main_#t~nondet2; VAL [main_~i~0=0, main_~j~0=-2147483648, main_~k~0=-2147483648] [L18-L23] COND FALSE !(!(main_~i~0 <= 100 && main_~j~0 <= main_~k~0)) [L19] main_~ell~0 := main_~i~0; [L20] main_~i~0 := main_~j~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=-2147483648, main_~k~0=-2147483648] [L21] assert 1 + main_~ell~0 >= -2147483648; [L21] main_~j~0 := 1 + main_~ell~0; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 <= 2147483647; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L22] assert main_~k~0 - 1 >= -2147483648; VAL [main_~ell~0=0, main_~i~0=-2147483648, main_~j~0=1, main_~k~0=-2147483648] [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; [L21] assert 1 + ~ell~0 <= 2147483647; [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; [L22] assert ~k~0 - 1 <= 2147483647; [L22] assert ~k~0 - 1 >= -2147483648; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L14] havoc ~i~0; [L14] havoc ~j~0; [L14] havoc ~k~0; [L14] havoc ~ell~0; [L15] assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; [L15] ~i~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L16] ~j~0 := #t~nondet1; [L16] havoc #t~nondet1; [L17] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L17] ~k~0 := #t~nondet2; [L17] havoc #t~nondet2; [L18-L23] COND FALSE !(!(~i~0 <= 100 && ~j~0 <= ~k~0)) [L19] ~ell~0 := ~i~0; [L20] ~i~0 := ~j~0; [L21] assert 1 + ~ell~0 <= 2147483647; [L21] assert 1 + ~ell~0 >= -2147483648; [L21] ~j~0 := 1 + ~ell~0; [L22] assert ~k~0 - 1 <= 2147483647; [L22] assert ~k~0 - 1 >= -2147483648; [L14] int i, j, k, ell; [L15] i = __VERIFIER_nondet_int() [L16] j = __VERIFIER_nondet_int() [L17] k = __VERIFIER_nondet_int() [L18] COND TRUE i <= 100 && j <= k [L19] ell = i [L20] i = j [L21] EXPR ell + 1 [L21] j = ell + 1 [L22] k - 1 ----- [2018-11-23 05:51:56,928 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3c86384c-0cef-4c4d-8808-8cf901f8e178/bin-2019/ukojak/witness.graphml [2018-11-23 05:51:56,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:51:56,929 INFO L168 Benchmark]: Toolchain (without parser) took 980.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -85.3 MB). Peak memory consumption was 41.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:56,930 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:51:56,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 144.02 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:56,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.71 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-23 05:51:56,931 INFO L168 Benchmark]: Boogie Preprocessor took 11.10 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-23 05:51:56,931 INFO L168 Benchmark]: RCFGBuilder took 171.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:56,932 INFO L168 Benchmark]: CodeCheck took 597.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.3 MB). Peak memory consumption was 67.3 MB. Max. memory is 11.5 GB. [2018-11-23 05:51:56,932 INFO L168 Benchmark]: Witness Printer took 35.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 05:51:56,934 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, 14 locations, 4 error locations. UNSAFE Result, 0.5s OverallTime, 4 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16 SDtfs, 20 SDslu, 8 SDs, 0 SdLazy, 124 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 101 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 22]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int i, j, k, ell; [L15] i = __VERIFIER_nondet_int() [L16] j = __VERIFIER_nondet_int() [L17] k = __VERIFIER_nondet_int() [L18] COND TRUE i <= 100 && j <= k [L19] ell = i [L20] i = j [L21] EXPR ell + 1 [L21] j = ell + 1 [L22] k - 1 * 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 144.02 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.71 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 11.10 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 171.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -166.0 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * CodeCheck took 597.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.3 MB). Peak memory consumption was 67.3 MB. Max. memory is 11.5 GB. * Witness Printer took 35.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...