./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/skippedu_false-unreach-call.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_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/array-tiling/skippedu_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/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 69a8cdfb90da21c880e2ea8c68ae8d9efb957756 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:06:37,588 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:06:37,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:06:37,596 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:06:37,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:06:37,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:06:37,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:06:37,599 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:06:37,600 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:06:37,601 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:06:37,601 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:06:37,602 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:06:37,602 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:06:37,603 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:06:37,604 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:06:37,604 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:06:37,605 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:06:37,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:06:37,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:06:37,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:06:37,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:06:37,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:06:37,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:06:37,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:06:37,613 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:06:37,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:06:37,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:06:37,614 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:06:37,615 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:06:37,616 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:06:37,616 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:06:37,616 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:06:37,617 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:06:37,617 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:06:37,617 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:06:37,618 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:06:37,618 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/config/svcomp-Reach-32bit-Kojak_Default.epf [2018-11-23 13:06:37,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:06:37,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:06:37,629 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:06:37,629 INFO L133 SettingsManager]: * ... to procedures called more than once=ALWAYS [2018-11-23 13:06:37,630 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:06:37,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:06:37,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:06:37,630 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:06:37,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:06:37,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:06:37,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:06:37,631 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:06:37,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:06:37,631 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:06:37,631 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:06:37,631 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:06:37,631 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:06:37,631 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:06:37,632 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 13:06:37,632 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 13:06:37,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:06:37,632 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:06:37,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 13:06:37,632 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:06:37,633 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:06:37,633 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:06:37,633 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 13:06:37,633 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:06:37,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:06:37,633 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_6d5a1a5d-06ed-4b99-804c-20fa46f96806/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 -> 69a8cdfb90da21c880e2ea8c68ae8d9efb957756 [2018-11-23 13:06:37,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:06:37,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:06:37,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:06:37,667 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:06:37,668 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:06:37,668 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/../../sv-benchmarks/c/array-tiling/skippedu_false-unreach-call.i [2018-11-23 13:06:37,704 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/data/fdc7bc27b/035ef3107a6d4f1cb495d1afb21e3c7b/FLAGdf0b2cd74 [2018-11-23 13:06:37,997 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:06:37,997 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/sv-benchmarks/c/array-tiling/skippedu_false-unreach-call.i [2018-11-23 13:06:38,001 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/data/fdc7bc27b/035ef3107a6d4f1cb495d1afb21e3c7b/FLAGdf0b2cd74 [2018-11-23 13:06:38,011 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/data/fdc7bc27b/035ef3107a6d4f1cb495d1afb21e3c7b [2018-11-23 13:06:38,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:06:38,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:06:38,015 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:38,015 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:06:38,017 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:06:38,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5022e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38, skipping insertion in model container [2018-11-23 13:06:38,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:06:38,037 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:06:38,141 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:38,143 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:06:38,155 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:06:38,166 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:06:38,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38 WrapperNode [2018-11-23 13:06:38,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:06:38,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:38,167 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:06:38,167 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:06:38,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:06:38,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:06:38,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:06:38,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:06:38,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,252 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:06:38,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:06:38,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:06:38,254 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:06:38,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:06:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/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 13:06:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:06:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:06:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:06:38,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:06:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:06:38,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:06:38,529 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:06:38,530 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 13:06:38,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:38 BoogieIcfgContainer [2018-11-23 13:06:38,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:06:38,530 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 13:06:38,530 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 13:06:38,542 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 13:06:38,542 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:38" (1/1) ... [2018-11-23 13:06:38,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:06:38,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:06:38,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 12 states and 16 transitions. [2018-11-23 13:06:38,581 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-11-23 13:06:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 13:06:38,583 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:06:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:06:38,773 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 13:06:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 13:06:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 13 states and 17 transitions. [2018-11-23 13:06:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2018-11-23 13:06:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 13:06:38,837 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 13:06:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:06:38,929 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];~SIZE~0 := 0;havoc main_#res;havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0.base, main_~#a~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;~SIZE~0 := main_#t~nondet1;havoc main_#t~nondet1; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~SIZE~0=2] [?] assume ~SIZE~0 > 1;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);main_~i~0 := 1; VAL [ULTIMATE.start_main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume !!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 2), 4);BeginParallelComposition{ParallelCodeBlock0: assume main_#t~mem3 > main_~i~0;havoc main_#t~mem3;call write~int(2 * main_~i~0 - 2, main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 2), 4);ParallelCodeBlock1: assume !(main_#t~mem3 > main_~i~0);havoc main_#t~mem3;}EndParallelCompositioncall main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4);BeginParallelComposition{ParallelCodeBlock0: assume main_#t~mem4 > main_~i~0;havoc main_#t~mem4;call write~int(2 * main_~i~0 - 1, main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4);ParallelCodeBlock1: assume !(main_#t~mem4 > main_~i~0);havoc main_#t~mem4;}EndParallelCompositionmain_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; VAL [ULTIMATE.start_main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));}EndParallelCompositionmain_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume !!(main_~i~0 < ~SIZE~0);call main_#t~mem6 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem6|=1, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem6|=1, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem6|=1, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L12] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L12] ~SIZE~0 := main_#t~nondet1; [L12] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc main_~i~0; [L16] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] main_~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 2), 4); [L23-L26] assume !(main_#t~mem3 > main_~i~0); [L23] havoc main_#t~mem3; [L27] call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4); [L27-L30] assume main_#t~mem4 > main_~i~0; [L27] havoc main_#t~mem4; [L29] call write~int(2 * main_~i~0 - 1, main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4); [L21] main_#t~post2 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post2; [L21] havoc main_#t~post2; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=2, ~SIZE~0=2] [L21-L31] assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L33] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(main_~i~0 < ~SIZE~0); [L35] call main_#t~mem6 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L35] __VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0); [L35] havoc __VERIFIER_assert_~cond; [L5] __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~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L12] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L12] ~SIZE~0 := main_#t~nondet1; [L12] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc main_~i~0; [L16] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] main_~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 2), 4); [L23-L26] assume !(main_#t~mem3 > main_~i~0); [L23] havoc main_#t~mem3; [L27] call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4); [L27-L30] assume main_#t~mem4 > main_~i~0; [L27] havoc main_#t~mem4; [L29] call write~int(2 * main_~i~0 - 1, main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4); [L21] main_#t~post2 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post2; [L21] havoc main_#t~post2; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=2, ~SIZE~0=2] [L21-L31] assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L33] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(main_~i~0 < ~SIZE~0); [L35] call main_#t~mem6 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L35] __VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0); [L35] havoc __VERIFIER_assert_~cond; [L5] __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~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0; [L12] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L12] ~SIZE~0 := main_#t~nondet1; [L12] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc main_~i~0; [L16] FCALL call main_~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] main_~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 2) }, 4); [L23] COND FALSE !(main_#t~mem3 > main_~i~0) [L23] havoc main_#t~mem3; [L27] FCALL call main_#t~mem4 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 1) }, 4); [L27] COND TRUE main_#t~mem4 > main_~i~0 [L27] havoc main_#t~mem4; [L29] FCALL call write~int(2 * main_~i~0 - 1, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 1) }, 4); [L21] main_#t~post2 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post2; [L21] havoc main_#t~post2; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) [L33] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(main_~i~0 < ~SIZE~0)) [L35] FCALL call main_#t~mem6 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L35] __VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0); [L35] havoc __VERIFIER_assert_~cond; [L5] __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~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0; [L12] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L12] ~SIZE~0 := main_#t~nondet1; [L12] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc main_~i~0; [L16] FCALL call main_~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] main_~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 2) }, 4); [L23] COND FALSE !(main_#t~mem3 > main_~i~0) [L23] havoc main_#t~mem3; [L27] FCALL call main_#t~mem4 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 1) }, 4); [L27] COND TRUE main_#t~mem4 > main_~i~0 [L27] havoc main_#t~mem4; [L29] FCALL call write~int(2 * main_~i~0 - 1, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 1) }, 4); [L21] main_#t~post2 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post2; [L21] havoc main_#t~post2; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) [L33] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(main_~i~0 < ~SIZE~0)) [L35] FCALL call main_#t~mem6 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L35] __VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0); [L35] havoc __VERIFIER_assert_~cond; [L5] __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~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); [L27] COND TRUE #t~mem4 > ~i~0 [L27] havoc #t~mem4; [L29] FCALL call write~int(2 * ~i~0 - 1, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L5] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); [L27] COND TRUE #t~mem4 > ~i~0 [L27] havoc #t~mem4; [L29] FCALL call write~int(2 * ~i~0 - 1, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L5] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L8] int SIZE; [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR a[2*i-1] [L27] COND TRUE a[2*i-1] > i [L29] a[2*i-1] = 2*i-1 [L21] i++ VAL [SIZE=2] [L21] COND FALSE !(i <= SIZE/2) [L33] i = 0 VAL [SIZE=2] [L33] COND TRUE i < SIZE [L35] a[i] [L5] COND TRUE !(cond) VAL [SIZE=2] [L5] __VERIFIER_error() VAL [SIZE=2] ----- [2018-11-23 13:06:38,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 01:06:38 ImpRootNode [2018-11-23 13:06:38,974 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 13:06:38,975 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:06:38,975 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:06:38,975 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:06:38,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:06:38" (3/4) ... [2018-11-23 13:06:38,977 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];~SIZE~0 := 0;havoc main_#res;havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0.base, main_~#a~0.offset;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;~SIZE~0 := main_#t~nondet1;havoc main_#t~nondet1; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~SIZE~0=2] [?] assume ~SIZE~0 > 1;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2));assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0);main_~i~0 := 1; VAL [ULTIMATE.start_main_~i~0=1, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume !!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 2), 4);BeginParallelComposition{ParallelCodeBlock0: assume main_#t~mem3 > main_~i~0;havoc main_#t~mem3;call write~int(2 * main_~i~0 - 2, main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 2), 4);ParallelCodeBlock1: assume !(main_#t~mem3 > main_~i~0);havoc main_#t~mem3;}EndParallelCompositioncall main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4);BeginParallelComposition{ParallelCodeBlock0: assume main_#t~mem4 > main_~i~0;havoc main_#t~mem4;call write~int(2 * main_~i~0 - 1, main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4);ParallelCodeBlock1: assume !(main_#t~mem4 > main_~i~0);havoc main_#t~mem4;}EndParallelCompositionmain_#t~post2 := main_~i~0;main_~i~0 := 1 + main_#t~post2;havoc main_#t~post2; VAL [ULTIMATE.start_main_~i~0=2, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] BeginParallelComposition{ParallelCodeBlock0: assume !true;ParallelCodeBlock1: assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2));}EndParallelCompositionmain_~i~0 := 0; VAL [ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume !!(main_~i~0 < ~SIZE~0);call main_#t~mem6 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem6|=1, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume 0 == __VERIFIER_assert_~cond; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem6|=1, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] assume !false; VAL [ULTIMATE.start___VERIFIER_assert_~cond=0, ULTIMATE.start_main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start___VERIFIER_assert_#in~cond|=0, |ULTIMATE.start_main_#t~mem6|=1, |ULTIMATE.start_main_~#a~0.base|=5, |ULTIMATE.start_main_~#a~0.offset|=0, ~SIZE~0=2] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L12] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L12] ~SIZE~0 := main_#t~nondet1; [L12] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc main_~i~0; [L16] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] main_~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 2), 4); [L23-L26] assume !(main_#t~mem3 > main_~i~0); [L23] havoc main_#t~mem3; [L27] call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4); [L27-L30] assume main_#t~mem4 > main_~i~0; [L27] havoc main_#t~mem4; [L29] call write~int(2 * main_~i~0 - 1, main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4); [L21] main_#t~post2 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post2; [L21] havoc main_#t~post2; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=2, ~SIZE~0=2] [L21-L31] assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L33] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(main_~i~0 < ~SIZE~0); [L35] call main_#t~mem6 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L35] __VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0); [L35] havoc __VERIFIER_assert_~cond; [L5] __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~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L8] ~SIZE~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L12] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L12] ~SIZE~0 := main_#t~nondet1; [L12] havoc main_#t~nondet1; VAL [#NULL.base=0, #NULL.offset=0, ~SIZE~0=2] [L13-L37] assume ~SIZE~0 > 1; [L15] havoc main_~i~0; [L16] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, ~SIZE~0=2] [L18] assume !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)); [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] main_~i~0 := 1; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=1, ~SIZE~0=2] [L21-L31] assume !!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L23] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 2), 4); [L23-L26] assume !(main_#t~mem3 > main_~i~0); [L23] havoc main_#t~mem3; [L27] call main_#t~mem4 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4); [L27-L30] assume main_#t~mem4 > main_~i~0; [L27] havoc main_#t~mem4; [L29] call write~int(2 * main_~i~0 - 1, main_~#a~0.base, main_~#a~0.offset + 4 * (2 * main_~i~0 - 1), 4); [L21] main_#t~post2 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post2; [L21] havoc main_#t~post2; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=2, ~SIZE~0=2] [L21-L31] assume !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)); [L33] main_~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L33-L36] assume !!(main_~i~0 < ~SIZE~0); [L35] call main_#t~mem6 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L35] __VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0); [L35] havoc __VERIFIER_assert_~cond; [L5] __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~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assume 0 == __VERIFIER_assert_~cond; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL.base=0, #NULL.offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0.base=5, main_~#a~0.offset=0, main_~i~0=0, ~SIZE~0=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0; [L12] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L12] ~SIZE~0 := main_#t~nondet1; [L12] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc main_~i~0; [L16] FCALL call main_~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] main_~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 2) }, 4); [L23] COND FALSE !(main_#t~mem3 > main_~i~0) [L23] havoc main_#t~mem3; [L27] FCALL call main_#t~mem4 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 1) }, 4); [L27] COND TRUE main_#t~mem4 > main_~i~0 [L27] havoc main_#t~mem4; [L29] FCALL call write~int(2 * main_~i~0 - 1, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 1) }, 4); [L21] main_#t~post2 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post2; [L21] havoc main_#t~post2; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) [L33] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(main_~i~0 < ~SIZE~0)) [L35] FCALL call main_#t~mem6 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L35] __VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0); [L35] havoc __VERIFIER_assert_~cond; [L5] __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~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; [?] havoc main_#res; [?] havoc main_#t~nondet1, main_#t~mem3, main_#t~mem4, main_#t~post2, main_#t~mem6, main_#t~post5, main_~i~0, main_~#a~0; [L12] assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647; [L12] ~SIZE~0 := main_#t~nondet1; [L12] havoc main_#t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc main_~i~0; [L16] FCALL call main_~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] main_~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=1, ~SIZE~0=2] [L21-L31] COND FALSE !(!(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 2) }, 4); [L23] COND FALSE !(main_#t~mem3 > main_~i~0) [L23] havoc main_#t~mem3; [L27] FCALL call main_#t~mem4 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 1) }, 4); [L27] COND TRUE main_#t~mem4 > main_~i~0 [L27] havoc main_#t~mem4; [L29] FCALL call write~int(2 * main_~i~0 - 1, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * (2 * main_~i~0 - 1) }, 4); [L21] main_#t~post2 := main_~i~0; [L21] main_~i~0 := 1 + main_#t~post2; [L21] havoc main_#t~post2; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=2, ~SIZE~0=2] [L21-L31] COND TRUE !(main_~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) [L33] main_~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(main_~i~0 < ~SIZE~0)) [L35] FCALL call main_#t~mem6 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L35] __VERIFIER_assert_#in~cond := (if main_#t~mem6 <= main_~i~0 then 1 else 0); [L35] havoc __VERIFIER_assert_~cond; [L5] __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~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L5] COND TRUE 0 == __VERIFIER_assert_~cond VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL!base=0, #NULL!offset=0, __VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_#t~mem6=1, main_~#a~0!base=5, main_~#a~0!offset=0, main_~i~0=0, ~SIZE~0=2] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); [L27] COND TRUE #t~mem4 > ~i~0 [L27] havoc #t~mem4; [L29] FCALL call write~int(2 * ~i~0 - 1, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L5] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L8] ~SIZE~0 := 0; [L12] assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; [L12] ~SIZE~0 := #t~nondet1; [L12] havoc #t~nondet1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L13] COND TRUE ~SIZE~0 > 1 [L15] havoc ~i~0; [L16] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~SIZE~0); VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L18] COND FALSE !(0 != (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2)) [L20] assume 0 != (if 0 == (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then ~SIZE~0 % 2 - 2 else ~SIZE~0 % 2) then 1 else 0); [L21] ~i~0 := 1; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L21-L31] COND FALSE !(!(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2))) [L23] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 2) }, 4); [L23] COND FALSE !(#t~mem3 > ~i~0) [L23] havoc #t~mem3; [L27] FCALL call #t~mem4 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); [L27] COND TRUE #t~mem4 > ~i~0 [L27] havoc #t~mem4; [L29] FCALL call write~int(2 * ~i~0 - 1, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * (2 * ~i~0 - 1) }, 4); [L21] #t~post2 := ~i~0; [L21] ~i~0 := 1 + #t~post2; [L21] havoc #t~post2; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L21-L31] COND TRUE !(~i~0 <= (if ~SIZE~0 < 0 && 0 != ~SIZE~0 % 2 then 1 + ~SIZE~0 / 2 else ~SIZE~0 / 2)) [L33] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L33-L36] COND FALSE !(!(~i~0 < ~SIZE~0)) [L35] FCALL call #t~mem6 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L5] ~cond := #in~cond; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L5] COND TRUE 0 == ~cond VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L5] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~SIZE~0=2] [L8] int SIZE; [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR a[2*i-1] [L27] COND TRUE a[2*i-1] > i [L29] a[2*i-1] = 2*i-1 [L21] i++ VAL [SIZE=2] [L21] COND FALSE !(i <= SIZE/2) [L33] i = 0 VAL [SIZE=2] [L33] COND TRUE i < SIZE [L35] a[i] [L5] COND TRUE !(cond) VAL [SIZE=2] [L5] __VERIFIER_error() VAL [SIZE=2] ----- [2018-11-23 13:06:39,017 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6d5a1a5d-06ed-4b99-804c-20fa46f96806/bin-2019/ukojak/witness.graphml [2018-11-23 13:06:39,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:06:39,018 INFO L168 Benchmark]: Toolchain (without parser) took 1003.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -105.4 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:39,019 INFO L168 Benchmark]: CDTParser took 0.10 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 13:06:39,019 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.91 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:39,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.03 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:39,020 INFO L168 Benchmark]: Boogie Preprocessor took 55.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:39,021 INFO L168 Benchmark]: RCFGBuilder took 276.29 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:39,021 INFO L168 Benchmark]: CodeCheck took 444.19 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: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:39,021 INFO L168 Benchmark]: Witness Printer took 42.51 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:06:39,024 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, 21 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 126 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: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L8] int SIZE; [L12] SIZE = __VERIFIER_nondet_int() [L13] COND TRUE SIZE > 1 [L15] int i; [L16] int a[SIZE]; VAL [SIZE=2] [L18] COND FALSE !(SIZE % 2 != 0) [L21] i = 1 VAL [SIZE=2] [L21] COND TRUE i <= SIZE/2 [L23] EXPR a[2*i-2] [L23] COND FALSE !(a[2*i-2] > i) [L27] EXPR a[2*i-1] [L27] COND TRUE a[2*i-1] > i [L29] a[2*i-1] = 2*i-1 [L21] i++ VAL [SIZE=2] [L21] COND FALSE !(i <= SIZE/2) [L33] i = 0 VAL [SIZE=2] [L33] COND TRUE i < SIZE [L35] a[i] [L5] COND TRUE !(cond) VAL [SIZE=2] [L5] __VERIFIER_error() VAL [SIZE=2] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.91 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 947.3 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 31.03 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 944.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -173.2 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 276.29 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * CodeCheck took 444.19 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: 28.4 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Witness Printer took 42.51 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...