./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_false-unreach-call1_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_false-unreach-call1_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 812742039d02caa806a6f44f2f3d29fbaac1cc75 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:41:37,557 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:41:37,558 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:41:37,567 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:41:37,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:41:37,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:41:37,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:41:37,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:41:37,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:41:37,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:41:37,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:41:37,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:41:37,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:41:37,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:41:37,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:41:37,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:41:37,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:41:37,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:41:37,579 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:41:37,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:41:37,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:41:37,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:41:37,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:41:37,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:41:37,584 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:41:37,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:41:37,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:41:37,586 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:41:37,586 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:41:37,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:41:37,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:41:37,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:41:37,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:41:37,588 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:41:37,589 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:41:37,590 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:41:37,590 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 14:41:37,601 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:41:37,601 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:41:37,601 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:41:37,602 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 14:41:37,602 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 14:41:37,602 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 14:41:37,603 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:41:37,603 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:41:37,603 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:41:37,603 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:41:37,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:41:37,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:41:37,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:41:37,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:41:37,604 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:41:37,604 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:41:37,604 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:41:37,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:41:37,604 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 14:41:37,604 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 14:41:37,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:41:37,605 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:41:37,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 14:41:37,605 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:41:37,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:41:37,605 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:41:37,605 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 14:41:37,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:41:37,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:41:37,606 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_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 812742039d02caa806a6f44f2f3d29fbaac1cc75 [2018-11-23 14:41:37,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:41:37,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:41:37,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:41:37,641 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:41:37,642 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:41:37,642 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_false-unreach-call1_false-termination.i [2018-11-23 14:41:37,685 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/data/0f816a3b0/ee4a369647af41f6b414b343ee07983a/FLAGade4d8a92 [2018-11-23 14:41:38,003 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:41:38,003 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/sv-benchmarks/c/loop-crafted/simple_array_index_value_false-unreach-call1_false-termination.i [2018-11-23 14:41:38,008 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/data/0f816a3b0/ee4a369647af41f6b414b343ee07983a/FLAGade4d8a92 [2018-11-23 14:41:38,020 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/data/0f816a3b0/ee4a369647af41f6b414b343ee07983a [2018-11-23 14:41:38,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:41:38,024 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:41:38,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:41:38,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:41:38,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:41:38,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@309c6631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38, skipping insertion in model container [2018-11-23 14:41:38,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:41:38,056 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:41:38,186 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:41:38,188 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:41:38,200 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:41:38,212 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:41:38,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38 WrapperNode [2018-11-23 14:41:38,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:41:38,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:41:38,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:41:38,213 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:41:38,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:41:38,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:41:38,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:41:38,233 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:41:38,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:41:38,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:41:38,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:41:38,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:41:38,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:41:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/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 14:41:38,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 14:41:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:41:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:41:38,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:41:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:41:38,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:41:38,451 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:41:38,451 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 14:41:38,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:38 BoogieIcfgContainer [2018-11-23 14:41:38,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:41:38,452 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 14:41:38,452 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 14:41:38,459 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 14:41:38,459 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:38" (1/1) ... [2018-11-23 14:41:38,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:41:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 9 states and 11 transitions. [2018-11-23 14:41:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-11-23 14:41:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 14:41:38,490 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:41:38,566 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 14:41:38,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 14:41:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-11-23 14:41:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-11-23 14:41:38,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-11-23 14:41:38,572 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 14:41:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:41:38,644 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 2 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0.base, main_~#array~0.offset, main_~index~0, main_~tmp~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(40000);main_~index~0 := 0;main_~tmp~0 := 0; VAL [ULTIMATE.start_main_~index~0=0, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] assume !false;main_~index~0 := main_#t~nondet1;havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] assume main_~index~0 % 4294967296 >= 10000; VAL [ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short3;call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296), 4);main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296;ParallelCodeBlock1: assume !main_#t~short3;}EndParallelComposition__VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem2|=9801115369473, |ULTIMATE.start_main_#t~short3|=false, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem2|=9801115369473, |ULTIMATE.start_main_#t~short3|=false, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem2|=9801115369473, |ULTIMATE.start_main_#t~short3|=false, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0.base, main_~#array~0.offset, main_~index~0, main_~tmp~0; [L21] call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(40000); [L22] main_~index~0 := 0; [L23] main_~tmp~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=0, main_~tmp~0=0] [L25-L32] assume !false; [L26] main_~index~0 := main_#t~nondet1; [L26] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L27-L29] assume main_~index~0 % 4294967296 >= 10000; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L34] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000; [L34] assume main_#t~short3; [L34] call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296), 4); [L34] main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296; [L34] __VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L9-L15] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L11-L13] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L12] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0.base, main_~#array~0.offset, main_~index~0, main_~tmp~0; [L21] call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(40000); [L22] main_~index~0 := 0; [L23] main_~tmp~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=0, main_~tmp~0=0] [L25-L32] assume !false; [L26] main_~index~0 := main_#t~nondet1; [L26] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L27-L29] assume main_~index~0 % 4294967296 >= 10000; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L34] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000; [L34] assume main_#t~short3; [L34] call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296), 4); [L34] main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296; [L34] __VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L9-L15] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L11-L13] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L12] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0, main_~index~0, main_~tmp~0; [L21] FCALL call main_~#array~0 := #Ultimate.alloc(40000); [L22] main_~index~0 := 0; [L23] main_~tmp~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=0, main_~tmp~0=0] [L25-L32] COND FALSE !(false) [L26] main_~index~0 := main_#t~nondet1; [L26] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L27] COND TRUE main_~index~0 % 4294967296 >= 10000 VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L34] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000; [L34] COND TRUE main_#t~short3 [L34] FCALL call main_#t~mem2 := read~int({ base: main_~#array~0!base, offset: main_~#array~0!offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L34] main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296; [L34] __VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L9-L15] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L11] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L12] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0, main_~index~0, main_~tmp~0; [L21] FCALL call main_~#array~0 := #Ultimate.alloc(40000); [L22] main_~index~0 := 0; [L23] main_~tmp~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=0, main_~tmp~0=0] [L25-L32] COND FALSE !(false) [L26] main_~index~0 := main_#t~nondet1; [L26] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L27] COND TRUE main_~index~0 % 4294967296 >= 10000 VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L34] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000; [L34] COND TRUE main_#t~short3 [L34] FCALL call main_#t~mem2 := read~int({ base: main_~#array~0!base, offset: main_~#array~0!offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L34] main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296; [L34] __VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L9-L15] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L11] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L12] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L21] FCALL call ~#array~0 := #Ultimate.alloc(40000); [L22] ~index~0 := 0; [L23] ~tmp~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L25-L32] COND FALSE !(false) [L26] ~index~0 := #t~nondet1; [L26] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L27] COND TRUE ~index~0 % 4294967296 >= 10000 VAL [#NULL!base=0, #NULL!offset=0] [L34] #t~short3 := ~tmp~0 % 4294967296 < 10000; [L34] COND TRUE #t~short3 [L34] FCALL call #t~mem2 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then ~tmp~0 % 4294967296 % 4294967296 else ~tmp~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L34] #t~short3 := #t~mem2 % 4294967296 == ~tmp~0 % 4294967296; [L9-L15] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L11] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L12] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L21] FCALL call ~#array~0 := #Ultimate.alloc(40000); [L22] ~index~0 := 0; [L23] ~tmp~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L25-L32] COND FALSE !(false) [L26] ~index~0 := #t~nondet1; [L26] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L27] COND TRUE ~index~0 % 4294967296 >= 10000 VAL [#NULL!base=0, #NULL!offset=0] [L34] #t~short3 := ~tmp~0 % 4294967296 < 10000; [L34] COND TRUE #t~short3 [L34] FCALL call #t~mem2 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then ~tmp~0 % 4294967296 % 4294967296 else ~tmp~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L34] #t~short3 := #t~mem2 % 4294967296 == ~tmp~0 % 4294967296; [L9-L15] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L11] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L12] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L21] unsigned int array[10000]; [L22] unsigned int index = 0; [L23] unsigned int tmp = 0; [L25] COND TRUE 1 [L26] index = __VERIFIER_nondet_uint() [L27] COND TRUE index >= 10000 [L34] tmp < 10000 && array[tmp] == tmp [L34] EXPR array[tmp] [L34] tmp < 10000 && array[tmp] == tmp [L11] COND TRUE !(cond) [L12] __VERIFIER_error() ----- [2018-11-23 14:41:38,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 02:41:38 ImpRootNode [2018-11-23 14:41:38,670 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 14:41:38,670 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:41:38,670 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:41:38,670 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:41:38,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:41:38" (3/4) ... [2018-11-23 14:41:38,672 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0.base, main_~#array~0.offset, main_~index~0, main_~tmp~0;call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(40000);main_~index~0 := 0;main_~tmp~0 := 0; VAL [ULTIMATE.start_main_~index~0=0, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] assume !false;main_~index~0 := main_#t~nondet1;havoc main_#t~nondet1; VAL [ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] assume main_~index~0 % 4294967296 >= 10000; VAL [ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000;BeginParallelComposition{ParallelCodeBlock0: assume main_#t~short3;call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296), 4);main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296;ParallelCodeBlock1: assume !main_#t~short3;}EndParallelComposition__VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem2|=9801115369473, |ULTIMATE.start_main_#t~short3|=false, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem2|=9801115369473, |ULTIMATE.start_main_#t~short3|=false, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~index~0=10000, ULTIMATE.start_main_~tmp~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem2|=9801115369473, |ULTIMATE.start_main_#t~short3|=false, |ULTIMATE.start_main_~#array~0.base|=2, |ULTIMATE.start_main_~#array~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0.base, main_~#array~0.offset, main_~index~0, main_~tmp~0; [L21] call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(40000); [L22] main_~index~0 := 0; [L23] main_~tmp~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=0, main_~tmp~0=0] [L25-L32] assume !false; [L26] main_~index~0 := main_#t~nondet1; [L26] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L27-L29] assume main_~index~0 % 4294967296 >= 10000; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L34] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000; [L34] assume main_#t~short3; [L34] call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296), 4); [L34] main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296; [L34] __VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L9-L15] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L11-L13] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L12] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0.base, main_~#array~0.offset, main_~index~0, main_~tmp~0; [L21] call main_~#array~0.base, main_~#array~0.offset := #Ultimate.alloc(40000); [L22] main_~index~0 := 0; [L23] main_~tmp~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=0, main_~tmp~0=0] [L25-L32] assume !false; [L26] main_~index~0 := main_#t~nondet1; [L26] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L27-L29] assume main_~index~0 % 4294967296 >= 10000; VAL [#NULL.base=0, #NULL.offset=0, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L34] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000; [L34] assume main_#t~short3; [L34] call main_#t~mem2 := read~int(main_~#array~0.base, main_~#array~0.offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296), 4); [L34] main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296; [L34] __VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L9-L15] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L11-L13] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [L12] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0.base=2, main_~#array~0.offset=0, main_~index~0=10000, main_~tmp~0=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0, main_~index~0, main_~tmp~0; [L21] FCALL call main_~#array~0 := #Ultimate.alloc(40000); [L22] main_~index~0 := 0; [L23] main_~tmp~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=0, main_~tmp~0=0] [L25-L32] COND FALSE !(false) [L26] main_~index~0 := main_#t~nondet1; [L26] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L27] COND TRUE main_~index~0 % 4294967296 >= 10000 VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L34] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000; [L34] COND TRUE main_#t~short3 [L34] FCALL call main_#t~mem2 := read~int({ base: main_~#array~0!base, offset: main_~#array~0!offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L34] main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296; [L34] __VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L9-L15] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L11] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L12] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem2, main_#t~short3, main_~#array~0, main_~index~0, main_~tmp~0; [L21] FCALL call main_~#array~0 := #Ultimate.alloc(40000); [L22] main_~index~0 := 0; [L23] main_~tmp~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=0, main_~tmp~0=0] [L25-L32] COND FALSE !(false) [L26] main_~index~0 := main_#t~nondet1; [L26] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L27] COND TRUE main_~index~0 % 4294967296 >= 10000 VAL [#NULL!base=0, #NULL!offset=0, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L34] main_#t~short3 := main_~tmp~0 % 4294967296 < 10000; [L34] COND TRUE main_#t~short3 [L34] FCALL call main_#t~mem2 := read~int({ base: main_~#array~0!base, offset: main_~#array~0!offset + 4 * (if main_~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then main_~tmp~0 % 4294967296 % 4294967296 else main_~tmp~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L34] main_#t~short3 := main_#t~mem2 % 4294967296 == main_~tmp~0 % 4294967296; [L34] __VERIFIER_assert_#in~cond := (if main_#t~short3 then 1 else 0); [L34] havoc __VERIFIER_assert_~cond; [L9-L15] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L11] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [L12] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem2=9801115369473, main_#t~short3=false, main_~#array~0!base=2, main_~#array~0!offset=0, main_~index~0=10000, main_~tmp~0=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L21] FCALL call ~#array~0 := #Ultimate.alloc(40000); [L22] ~index~0 := 0; [L23] ~tmp~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L25-L32] COND FALSE !(false) [L26] ~index~0 := #t~nondet1; [L26] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L27] COND TRUE ~index~0 % 4294967296 >= 10000 VAL [#NULL!base=0, #NULL!offset=0] [L34] #t~short3 := ~tmp~0 % 4294967296 < 10000; [L34] COND TRUE #t~short3 [L34] FCALL call #t~mem2 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then ~tmp~0 % 4294967296 % 4294967296 else ~tmp~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L34] #t~short3 := #t~mem2 % 4294967296 == ~tmp~0 % 4294967296; [L9-L15] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L11] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L12] assert false; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L21] FCALL call ~#array~0 := #Ultimate.alloc(40000); [L22] ~index~0 := 0; [L23] ~tmp~0 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L25-L32] COND FALSE !(false) [L26] ~index~0 := #t~nondet1; [L26] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0] [L27] COND TRUE ~index~0 % 4294967296 >= 10000 VAL [#NULL!base=0, #NULL!offset=0] [L34] #t~short3 := ~tmp~0 % 4294967296 < 10000; [L34] COND TRUE #t~short3 [L34] FCALL call #t~mem2 := read~int({ base: ~#array~0!base, offset: ~#array~0!offset + 4 * (if ~tmp~0 % 4294967296 % 4294967296 <= 2147483647 then ~tmp~0 % 4294967296 % 4294967296 else ~tmp~0 % 4294967296 % 4294967296 - 4294967296) }, 4); [L34] #t~short3 := #t~mem2 % 4294967296 == ~tmp~0 % 4294967296; [L9-L15] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0] [L11] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0] [L12] assert false; VAL [#NULL!base=0, #NULL!offset=0] [L21] unsigned int array[10000]; [L22] unsigned int index = 0; [L23] unsigned int tmp = 0; [L25] COND TRUE 1 [L26] index = __VERIFIER_nondet_uint() [L27] COND TRUE index >= 10000 [L34] tmp < 10000 && array[tmp] == tmp [L34] EXPR array[tmp] [L34] tmp < 10000 && array[tmp] == tmp [L11] COND TRUE !(cond) [L12] __VERIFIER_error() ----- [2018-11-23 14:41:38,702 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4f202ab6-9182-40c0-9890-13fea517a098/bin-2019/ukojak/witness.graphml [2018-11-23 14:41:38,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:41:38,703 INFO L168 Benchmark]: Toolchain (without parser) took 679.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 954.8 MB in the beginning and 1.1 GB in the end (delta: -191.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:41:38,704 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:41:38,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.66 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:38,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.15 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:38,705 INFO L168 Benchmark]: Boogie Preprocessor took 52.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 941.4 MB in the beginning and 1.2 GB in the end (delta: -243.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:38,706 INFO L168 Benchmark]: RCFGBuilder took 166.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:38,706 INFO L168 Benchmark]: CodeCheck took 217.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:38,707 INFO L168 Benchmark]: Witness Printer took 32.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:41:38,709 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, 1 error locations. UNSAFE Result, 0.1s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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: 12]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L21] unsigned int array[10000]; [L22] unsigned int index = 0; [L23] unsigned int tmp = 0; [L25] COND TRUE 1 [L26] index = __VERIFIER_nondet_uint() [L27] COND TRUE index >= 10000 [L34] tmp < 10000 && array[tmp] == tmp [L34] EXPR array[tmp] [L34] tmp < 10000 && array[tmp] == tmp [L11] COND TRUE !(cond) [L12] __VERIFIER_error() * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 187.66 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 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 20.15 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 189.3 MB). Free memory was 941.4 MB in the beginning and 1.2 GB in the end (delta: -243.5 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 166.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * CodeCheck took 217.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * Witness Printer took 32.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...