./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc8491de7bb3fbae410adb8e5711b9887b8c9c8f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 05:57:51,278 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 05:57:51,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 05:57:51,287 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 05:57:51,287 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 05:57:51,288 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 05:57:51,289 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 05:57:51,290 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 05:57:51,291 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 05:57:51,292 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 05:57:51,292 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 05:57:51,293 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 05:57:51,293 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 05:57:51,294 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 05:57:51,295 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 05:57:51,295 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 05:57:51,296 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 05:57:51,297 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 05:57:51,298 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 05:57:51,300 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 05:57:51,300 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 05:57:51,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 05:57:51,303 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 05:57:51,303 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 05:57:51,303 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 05:57:51,304 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 05:57:51,305 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 05:57:51,305 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 05:57:51,306 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 05:57:51,307 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 05:57:51,307 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 05:57:51,307 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 05:57:51,307 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 05:57:51,308 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 05:57:51,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 05:57:51,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 05:57:51,309 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-12-09 05:57:51,318 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 05:57:51,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 05:57:51,319 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 05:57:51,320 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 05:57:51,320 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 05:57:51,320 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 05:57:51,320 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 05:57:51,320 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 05:57:51,320 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 05:57:51,320 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 05:57:51,320 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-09 05:57:51,321 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-09 05:57:51,321 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-09 05:57:51,321 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 05:57:51,321 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 05:57:51,321 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 05:57:51,321 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-12-09 05:57:51,321 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-12-09 05:57:51,321 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 05:57:51,322 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 05:57:51,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-12-09 05:57:51,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 05:57:51,322 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 05:57:51,322 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-12-09 05:57:51,322 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 05:57:51,322 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> dc8491de7bb3fbae410adb8e5711b9887b8c9c8f [2018-12-09 05:57:51,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 05:57:51,350 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 05:57:51,352 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 05:57:51,353 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 05:57:51,353 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 05:57:51,354 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/../../sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-12-09 05:57:51,389 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/data/87b663e85/fa9c0a5ff699455a8964b4d77b42a477/FLAG513afb3b4 [2018-12-09 05:57:51,832 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 05:57:51,832 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/sv-benchmarks/c/array-memsafety/array03-alloca_true-valid-memsafety_true-termination.i [2018-12-09 05:57:51,839 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/data/87b663e85/fa9c0a5ff699455a8964b4d77b42a477/FLAG513afb3b4 [2018-12-09 05:57:51,846 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/data/87b663e85/fa9c0a5ff699455a8964b4d77b42a477 [2018-12-09 05:57:51,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 05:57:51,849 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 05:57:51,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 05:57:51,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 05:57:51,851 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 05:57:51,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:57:51" (1/1) ... [2018-12-09 05:57:51,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c26117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:51, skipping insertion in model container [2018-12-09 05:57:51,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 05:57:51" (1/1) ... [2018-12-09 05:57:51,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 05:57:51,880 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 05:57:52,036 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:57:52,043 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 05:57:52,099 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 05:57:52,118 INFO L195 MainTranslator]: Completed translation [2018-12-09 05:57:52,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52 WrapperNode [2018-12-09 05:57:52,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 05:57:52,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 05:57:52,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 05:57:52,119 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 05:57:52,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 05:57:52,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 05:57:52,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 05:57:52,145 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 05:57:52,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,159 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 05:57:52,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 05:57:52,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 05:57:52,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 05:57:52,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 05:57:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/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-12-09 05:57:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 05:57:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 05:57:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 05:57:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 05:57:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 05:57:52,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 05:57:52,401 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 05:57:52,401 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 05:57:52,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:57:52 BoogieIcfgContainer [2018-12-09 05:57:52,401 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 05:57:52,401 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-12-09 05:57:52,402 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-12-09 05:57:52,408 INFO L276 PluginConnector]: CodeCheck initialized [2018-12-09 05:57:52,408 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:57:52" (1/1) ... [2018-12-09 05:57:52,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 05:57:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:52,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 28 states and 31 transitions. [2018-12-09 05:57:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-12-09 05:57:52,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-09 05:57:52,440 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:52,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 27 states and 30 transitions. [2018-12-09 05:57:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-12-09 05:57:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-09 05:57:52,553 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 28 states and 32 transitions. [2018-12-09 05:57:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-09 05:57:52,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-09 05:57:52,644 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 30 states and 35 transitions. [2018-12-09 05:57:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-12-09 05:57:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-09 05:57:52,843 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 29 states and 33 transitions. [2018-12-09 05:57:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-09 05:57:52,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-09 05:57:52,872 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 28 states and 32 transitions. [2018-12-09 05:57:52,997 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-09 05:57:52,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-09 05:57:52,997 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:53,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 27 states and 31 transitions. [2018-12-09 05:57:53,013 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-12-09 05:57:53,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-09 05:57:53,013 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:53,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 26 states and 30 transitions. [2018-12-09 05:57:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-09 05:57:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 05:57:53,029 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:53,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 25 states and 29 transitions. [2018-12-09 05:57:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-12-09 05:57:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 05:57:53,048 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:53,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 24 states and 28 transitions. [2018-12-09 05:57:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-12-09 05:57:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-09 05:57:53,070 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 26 states and 32 transitions. [2018-12-09 05:57:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2018-12-09 05:57:53,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 05:57:53,506 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:53,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:53,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 25 states and 31 transitions. [2018-12-09 05:57:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2018-12-09 05:57:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-09 05:57:53,529 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:53,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 24 states and 30 transitions. [2018-12-09 05:57:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2018-12-09 05:57:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 05:57:53,578 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:53,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 05:57:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 31 states and 44 transitions. [2018-12-09 05:57:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2018-12-09 05:57:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 05:57:55,102 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:55,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:57,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:57,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 37 states and 58 transitions. [2018-12-09 05:57:57,814 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2018-12-09 05:57:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 05:57:57,814 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 38 states and 60 transitions. [2018-12-09 05:57:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 60 transitions. [2018-12-09 05:57:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 05:57:58,037 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:58,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:57:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 37 states and 59 transitions. [2018-12-09 05:57:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2018-12-09 05:57:58,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 05:57:58,062 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:58,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:57:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 36 states and 58 transitions. [2018-12-09 05:57:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 58 transitions. [2018-12-09 05:57:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 05:57:58,117 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 05:57:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:58,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 39 states and 62 transitions. [2018-12-09 05:57:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 62 transitions. [2018-12-09 05:57:58,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 05:57:58,515 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:58,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 40 states and 63 transitions. [2018-12-09 05:57:58,544 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2018-12-09 05:57:58,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 05:57:58,544 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 42 states and 66 transitions. [2018-12-09 05:57:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2018-12-09 05:57:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 05:57:59,051 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:59,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:57:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 41 states and 65 transitions. [2018-12-09 05:57:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2018-12-09 05:57:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 05:57:59,076 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:59,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:57:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 05:57:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:57:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 40 states and 64 transitions. [2018-12-09 05:57:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 64 transitions. [2018-12-09 05:57:59,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 05:57:59,130 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:57:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:57:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:58:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:58:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 46 states and 76 transitions. [2018-12-09 05:58:01,249 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2018-12-09 05:58:01,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 05:58:01,249 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:58:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:58:01,261 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 05:58:01,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:58:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 47 states and 76 transitions. [2018-12-09 05:58:01,487 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 76 transitions. [2018-12-09 05:58:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 05:58:01,487 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:58:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:58:01,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:58:01,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 05:58:01,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:58:01,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 05:58:01,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-12-09 05:58:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:58:05,754 WARN L180 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-12-09 05:58:08,181 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-12-09 05:58:09,298 WARN L180 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-12-09 05:58:09,841 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 05:58:10,594 WARN L180 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-12-09 05:58:11,230 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-12-09 05:58:14,584 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-12-09 05:58:15,563 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 05:58:18,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:58:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 56 states and 94 transitions. [2018-12-09 05:58:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 94 transitions. [2018-12-09 05:58:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 05:58:18,498 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:58:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:58:18,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:58:18,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-09 05:58:18,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:58:18,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:58:18,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2018-12-09 05:58:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 05:58:26,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:58:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 63 states and 106 transitions. [2018-12-09 05:58:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 106 transitions. [2018-12-09 05:58:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:58:26,775 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:58:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:58:26,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:58:26,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 05:58:26,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:58:26,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 05:58:26,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:17 [2018-12-09 05:58:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 05:58:27,753 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-12-09 05:58:29,801 WARN L180 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-12-09 05:58:31,776 WARN L180 SmtUtils]: Spent 964.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-12-09 05:58:33,965 WARN L180 SmtUtils]: Spent 812.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-12-09 05:58:35,467 WARN L180 SmtUtils]: Spent 817.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-12-09 05:58:35,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:58:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 68 states and 111 transitions. [2018-12-09 05:58:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 111 transitions. [2018-12-09 05:58:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 05:58:35,955 INFO L431 CodeCheckObserver]: Error Path is FOUND. [2018-12-09 05:58:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 05:58:35,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 05:58:35,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-12-09 05:58:35,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 05:58:35,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 05:58:35,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2018-12-09 05:58:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 05:58:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-12-09 05:58:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 17 states and 21 transitions. [2018-12-09 05:58:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2018-12-09 05:58:39,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 05:58:39,114 WARN L428 CodeCheckObserver]: This Program is SAFE, Check terminated with 29 iterations. [2018-12-09 05:58:39,121 INFO L779 CodeCheckObserver]: All specifications hold 15 specifications checked. All of them hold [2018-12-09 05:58:39,318 INFO L583 CodeCheckObserver]: Invariant with dag size 35 [2018-12-09 05:58:39,320 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,321 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,321 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,321 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,322 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 05:58:39,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 05:58:39,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,323 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 05:58:39,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 05:58:39,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,328 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,329 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 09.12 05:58:39 ImpRootNode [2018-12-09 05:58:39,329 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-12-09 05:58:39,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 05:58:39,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 05:58:39,330 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 05:58:39,330 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 05:57:52" (3/4) ... [2018-12-09 05:58:39,332 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 05:58:39,338 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 05:58:39,338 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 05:58:39,338 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 05:58:39,338 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 05:58:39,354 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\exists ULTIMATE.start_main_~array_size~0 : int :: N <= ULTIMATE.start_main_~array_size~0 && 4 * ULTIMATE.start_main_~array_size~0 == unknown-#length-unknown[a]) && 0 == \old(unknown-main_\old_#valid-unknown)[__builtin_alloca (array_size * sizeof(int))]) && !(0 == __builtin_alloca (array_size * sizeof(int)))) && 1 <= i) && \old(unknown-main_\old_#valid-unknown)[0] == 0) && 0 == a) && \valid == \old(unknown-main_\old_#valid-unknown)[__builtin_alloca (array_size * sizeof(int)) := 1]) && 1 == \valid[a]) || (((((((((\exists ULTIMATE.start_main_~array_size~0 : int :: N <= ULTIMATE.start_main_~array_size~0 && 4 * ULTIMATE.start_main_~array_size~0 == unknown-#length-unknown[a]) && 0 == \old(unknown-main_\old_#valid-unknown)[__builtin_alloca (array_size * sizeof(int))]) && !(0 == __builtin_alloca (array_size * sizeof(int)))) && \old(unknown-main_\old_#valid-unknown)[0] == 0) && 0 == a) && \valid == \old(unknown-main_\old_#valid-unknown)[__builtin_alloca (array_size * sizeof(int)) := 1]) && 1 <= N) && i == 0) && 1 == \valid[a]) [2018-12-09 05:58:39,364 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4c8d7a9c-d8ad-4d74-9dd8-e1b06d25d6b5/bin-2019/ukojak/witness.graphml [2018-12-09 05:58:39,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 05:58:39,364 INFO L168 Benchmark]: Toolchain (without parser) took 47516.08 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 368.1 MB). Free memory was 954.9 MB in the beginning and 1.2 GB in the end (delta: -256.2 MB). Peak memory consumption was 111.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:58:39,365 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:58:39,365 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-12-09 05:58:39,365 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:58:39,365 INFO L168 Benchmark]: Boogie Preprocessor took 14.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 05:58:39,366 INFO L168 Benchmark]: RCFGBuilder took 241.70 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2018-12-09 05:58:39,366 INFO L168 Benchmark]: CodeCheck took 46927.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.3 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. [2018-12-09 05:58:39,366 INFO L168 Benchmark]: Witness Printer took 34.47 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. [2018-12-09 05:58:39,367 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, 38 locations, 15 error locations. SAFE Result, 46.6s OverallTime, 29 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 716701696 SDtfs, 580945880 SDslu, 445513728 SDs, 0 SdLazy, -1233406872 SolverSat, 1315528824 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2498 GetRequests, 2138 SyntacticMatches, 94 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31432 ImplicationChecksByTransitivity, 44.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 235 ConstructedInterpolants, 36 QuantifiedInterpolants, 39943 SizeOfPredicates, 24 NumberOfNonLiveVariables, 700 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 28 InterpolantComputations, 21 PerfectInterpolantSequences, 52/61 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 - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 546]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 558]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 553]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 552]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold - InvariantResult [Line: 544]: Loop Invariant [2018-12-09 05:58:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 05:58:39,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 05:58:39,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,369 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,370 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] [2018-12-09 05:58:39,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 05:58:39,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-09 05:58:39,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid [2018-12-09 05:58:39,371 WARN L1298 BoogieBacktranslator]: unknown boogie variable main_old_#valid Derived loop invariant: ((((((((\exists ULTIMATE.start_main_~array_size~0 : int :: N <= ULTIMATE.start_main_~array_size~0 && 4 * ULTIMATE.start_main_~array_size~0 == unknown-#length-unknown[a]) && 0 == \old(unknown-main_\old_#valid-unknown)[__builtin_alloca (array_size * sizeof(int))]) && !(0 == __builtin_alloca (array_size * sizeof(int)))) && 1 <= i) && \old(unknown-main_\old_#valid-unknown)[0] == 0) && 0 == a) && \valid == \old(unknown-main_\old_#valid-unknown)[__builtin_alloca (array_size * sizeof(int)) := 1]) && 1 == \valid[a]) || (((((((((\exists ULTIMATE.start_main_~array_size~0 : int :: N <= ULTIMATE.start_main_~array_size~0 && 4 * ULTIMATE.start_main_~array_size~0 == unknown-#length-unknown[a]) && 0 == \old(unknown-main_\old_#valid-unknown)[__builtin_alloca (array_size * sizeof(int))]) && !(0 == __builtin_alloca (array_size * sizeof(int)))) && \old(unknown-main_\old_#valid-unknown)[0] == 0) && 0 == a) && \valid == \old(unknown-main_\old_#valid-unknown)[__builtin_alloca (array_size * sizeof(int)) := 1]) && 1 <= N) && i == 0) && 1 == \valid[a]) * 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 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 269.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.97 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 241.70 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * CodeCheck took 46927.93 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 245.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -149.3 MB). Peak memory consumption was 96.6 MB. Max. memory is 11.5 GB. * Witness Printer took 34.47 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~array_size~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid - GenericResult: Unfinished Backtranslation unknown boogie variable main_old_#valid RESULT: Ultimate proved your program to be correct! Received shutdown request...